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 14, 2026 09:10Victor MerckléVictor MerckléScore: 63,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:1063,641535,529,396527,221,0001,003,0002,117,632stderr
2May 14, 2026 09:1063,646537,384,235527,269,0001,001,0002,117,632stderr
3May 14, 2026 09:1063,656537,749,318527,345,0001,001,0002,117,632stderr
4May 14, 2026 09:1063,663538,033,447527,407,0001,003,0002,117,632stderr
5May 14, 2026 09:1063,671535,805,780527,473,0001,001,0002,117,632stderr
6May 14, 2026 09:1063,680537,008,224527,546,0001,002,0002,117,632stderr
7May 14, 2026 09:1063,682535,888,585527,564,0001,002,0002,117,632stderr
8May 14, 2026 09:1063,690538,168,462527,630,0001,001,0002,117,632stderr
9May 14, 2026 09:1063,694535,892,661527,662,0001,002,0002,117,632stderr