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 10, 2026 03:57Josu San MartinJosu San MartinScore: 4,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:584,35551,944,01835,048,0001,103,0002,555,904
2May 10, 2026 03:584,38950,707,64435,252,0001,180,0002,547,712
3May 10, 2026 03:584,38951,859,88035,391,0001,039,0002,547,712
4May 10, 2026 03:584,39249,335,79835,425,0001,034,0002,551,808
5May 10, 2026 03:584,39852,540,04235,465,0001,043,0002,547,712
6May 10, 2026 03:584,40151,755,04835,494,0001,042,0002,539,520
7May 10, 2026 03:584,40251,016,39435,488,0001,049,0002,551,808
8May 10, 2026 03:584,40551,039,83235,531,0001,038,0002,547,712
9May 10, 2026 03:584,41852,486,21035,640,0001,034,0002,555,904