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 19:16Josu San MartinJosu San MartinScore: 4,876Success
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 19:164,80053,609,36638,636,0001,211,0002,359,296
2May 9, 2026 19:164,83855,539,50538,943,0001,220,0002,351,104
3May 9, 2026 19:164,86056,604,77739,107,0001,231,0002,342,912
4May 9, 2026 19:164,86356,951,90339,151,0001,213,0002,347,008
5May 9, 2026 19:164,87657,218,85739,267,0001,211,0002,342,912
6May 9, 2026 19:164,88756,984,67439,527,0001,039,0002,330,624
7May 9, 2026 19:164,89457,861,94139,403,0001,222,0002,351,104
8May 9, 2026 19:165,02056,243,24240,627,0001,047,0002,347,008
9May 9, 2026 19:165,08859,581,04541,010,0001,223,0002,351,104