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 15, 2026 06:18Victor MerckléVictor MerckléScore: 72,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 06:1872,624614,617,001546,276,00056,510,0002,113,536
2May 15, 2026 06:1872,684613,019,569545,658,00057,626,0002,113,536
3May 15, 2026 06:1872,691612,613,600545,983,00057,360,0002,113,536
4May 15, 2026 06:1872,702612,338,094545,849,00057,584,0002,113,536
5May 15, 2026 06:1872,718613,232,053545,382,00058,182,0002,113,536
6May 15, 2026 06:1872,728612,324,534546,078,00057,568,0002,113,536
7May 15, 2026 06:1872,733614,187,306546,006,00057,680,0002,113,536
8May 15, 2026 06:1872,792614,884,298546,067,00058,111,0002,113,536
9May 15, 2026 06:1872,873616,400,202546,051,00058,803,0002,113,536