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 18:29Victor MerckléVictor MerckléScore: 187,931Success
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 18:29186,9531,560,637,6891,550,701,0001,009,0002,117,632stderr
2May 13, 2026 18:29186,9571,559,835,1991,550,613,0001,134,0002,117,632stderr
3May 13, 2026 18:29186,9871,559,984,7921,550,946,0001,049,0002,117,632stderr
4May 13, 2026 18:29187,3061,564,934,5121,553,622,0001,018,0002,117,632stderr
5May 13, 2026 18:29187,9311,569,071,6701,557,823,0002,005,0002,117,632stderr
6May 13, 2026 18:29188,5701,572,457,8191,564,133,0001,003,0002,117,632stderr
7May 13, 2026 18:29188,6661,573,863,4671,564,794,0001,137,0002,117,632stderr
8May 13, 2026 18:29188,8511,577,432,8581,566,367,0001,104,0002,117,632stderr
9May 13, 2026 18:29189,5351,583,350,3431,571,976,0001,170,0002,117,632stderr