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 13, 2026 17:59Victor MerckléVictor MerckléScore: 68,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:5968,184573,676,983564,811,0001,121,0002,117,632stderr
2May 13, 2026 17:5968,257573,929,888565,451,0001,083,0002,117,632stderr
3May 13, 2026 17:5968,269573,990,616565,517,0001,120,0002,117,632stderr
4May 13, 2026 17:5968,293574,846,426565,711,0001,124,0002,117,632stderr
5May 13, 2026 17:5968,364574,744,236566,310,0001,118,0002,117,632stderr
6May 13, 2026 17:5968,418576,324,771566,769,0001,105,0002,117,632stderr
7May 13, 2026 17:5968,460576,779,506567,057,0001,169,0002,117,632stderr
8May 13, 2026 17:5968,563578,572,538568,048,0001,028,0002,117,632stderr
9May 13, 2026 17:5968,855581,321,179570,470,0001,031,0002,117,632stderr