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:54Victor MerckléVictor MerckléScore: 743,007Success
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:55742,6546,173,781,4526,163,034,0001,000,0002,117,632stderr
2May 13, 2026 17:55742,7516,176,026,4296,162,789,0002,050,0002,117,632stderr
3May 13, 2026 17:55742,9636,175,182,8656,165,536,0001,059,0002,117,632stderr
4May 13, 2026 17:55742,9666,173,882,2016,165,575,0001,046,0002,117,632stderr
5May 13, 2026 17:55743,0076,176,807,3756,165,882,0001,078,0002,117,632stderr
6May 13, 2026 17:55743,0166,176,269,9266,165,897,0001,143,0002,117,632stderr
7May 13, 2026 17:55743,3766,177,281,5886,168,987,0001,034,0002,117,632stderr
8May 13, 2026 17:55744,2776,186,431,8836,176,507,0001,000,0002,117,632stderr
9May 13, 2026 17:55744,6556,197,336,1906,179,593,0001,048,0002,117,632stderr