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 21:06Josu San MartinJosu San MartinScore: 4,897Success
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 21:064,78756,584,60638,519,0001,218,0002,359,296
2May 9, 2026 21:064,81557,346,00938,680,0001,289,0002,351,104
3May 9, 2026 21:064,82256,339,31139,002,0001,027,0002,342,912
4May 9, 2026 21:064,86654,168,67639,361,0001,031,0002,351,104
5May 9, 2026 21:064,89755,612,81439,610,0001,041,0002,326,528
6May 9, 2026 21:064,90656,756,12239,515,0001,208,0002,351,104
7May 9, 2026 21:064,97756,793,67740,287,0001,025,0002,342,912
8May 9, 2026 21:065,19461,475,93142,066,0001,045,0002,334,720
9May 9, 2026 21:065,22957,155,81242,365,0001,038,0002,347,008