Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 9, 2026 23:37Andrii StolitniiAndrii StolitniiScore: 87,534Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:3887,416744,910,529662,785,00062,768,0002,359,296
2May 9, 2026 23:3887,462741,190,607664,968,00060,974,0002,355,200
3May 9, 2026 23:3887,511742,790,364663,953,00062,389,0002,351,104
4May 9, 2026 23:3887,522745,858,705664,155,00062,284,0002,342,912
5May 9, 2026 23:3887,534741,485,369664,724,00061,813,0002,359,296
6May 9, 2026 23:3887,555741,104,785663,749,00062,960,0002,355,200
7May 9, 2026 23:3887,601743,748,294664,148,00062,941,0002,351,104
8May 9, 2026 23:3887,604742,397,009664,281,00062,839,0002,355,200
9May 9, 2026 23:3887,649745,267,463663,827,00063,662,0002,351,104