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 24, 2026 13:04Victor MerckléVictor MerckléScore: 7,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:057,36469,658,01660,069,0001,057,0002,113,536
2May 24, 2026 13:057,36471,365,66660,044,0001,078,0002,113,536
3May 24, 2026 13:057,36570,800,15160,058,0001,072,0002,113,536
4May 24, 2026 13:057,36670,981,94460,081,0001,065,0002,113,536
5May 24, 2026 13:057,37269,023,41760,127,0001,066,0002,113,536
6May 24, 2026 13:057,40870,937,79760,491,0001,001,0002,113,536
7May 24, 2026 13:057,40872,198,84260,466,0001,025,0002,113,536
8May 24, 2026 13:057,42770,641,86860,621,0001,029,0002,113,536
9May 24, 2026 13:057,87873,184,23364,329,0001,059,0002,113,536