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 20, 2026 17:58Victor MerckléVictor MerckléScore: 5,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 18:004,99151,048,49740,373,0001,060,0002,113,536
2May 20, 2026 18:004,99651,118,79340,413,0001,056,0002,113,536
3May 20, 2026 18:005,01550,063,58140,502,0001,129,0002,113,536
4May 20, 2026 18:005,01749,928,54040,640,0001,009,0002,113,536
5May 20, 2026 18:005,08151,877,27041,153,0001,025,0002,113,536
6May 20, 2026 18:005,08350,917,20841,090,0001,103,0002,113,536
7May 20, 2026 18:005,08850,079,43941,230,0001,006,0002,113,536
8May 20, 2026 18:005,09650,703,18241,274,0001,023,0002,113,536
9May 20, 2026 18:005,12352,049,30241,510,0001,014,0002,113,536