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:48Josu San MartinJosu San MartinScore: 5,252Success
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:495,22458,399,42442,288,0001,077,0002,293,760
2May 9, 2026 21:495,23257,231,60342,369,0001,064,0002,551,808
3May 9, 2026 21:495,23862,276,02442,392,0001,084,0002,555,904
4May 9, 2026 21:495,24260,364,15042,449,0001,060,0002,543,616
5May 9, 2026 21:495,25259,224,01542,560,0001,039,0002,555,904
6May 9, 2026 21:495,27959,262,39742,790,0001,026,0002,547,712
7May 9, 2026 21:495,33865,638,87043,212,0001,095,0002,547,712
8May 9, 2026 21:495,43660,463,23944,070,0001,052,0002,555,904
9May 9, 2026 21:495,45060,161,26344,171,0001,066,0002,535,424