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 11, 2026 02:15Josu San MartinJosu San MartinScore: 4,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 02:154,01141,850,82432,219,0001,074,0002,113,536
2May 11, 2026 02:154,01741,043,03332,229,0001,118,0002,113,536
3May 11, 2026 02:154,02943,911,08732,367,0001,078,0002,113,536
4May 11, 2026 02:154,03142,876,37132,383,0001,082,0002,113,536
5May 11, 2026 02:154,04141,667,43732,464,0001,081,0002,113,536
6May 11, 2026 02:154,04443,150,67532,496,0001,077,0002,113,536
7May 11, 2026 02:154,04741,189,69232,528,0001,064,0002,113,536
8May 11, 2026 02:154,12642,362,54533,167,0001,084,0002,113,536
9May 11, 2026 02:154,21944,207,72033,944,0001,076,0002,113,536