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 listAug 26, 2026 22:22Victor MerckléVictor MerckléScore: 17,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:2217,904156,973,052147,513,0001,091,0002,117,632stderr
2Aug 26, 2026 22:2217,946157,330,873147,843,0001,111,0002,117,632stderr
3Aug 26, 2026 22:2217,968157,494,649148,030,0001,108,0002,117,632stderr
4Aug 26, 2026 22:2217,969157,525,052148,044,0001,106,0002,117,632stderr
5Aug 26, 2026 22:2217,976157,575,991148,115,0001,092,0002,117,632stderr
6Aug 26, 2026 22:2217,995157,763,216148,216,0001,143,0002,117,632stderr
7Aug 26, 2026 22:2218,020158,588,343148,462,0001,106,0002,117,632stderr
8Aug 26, 2026 22:2218,020158,661,959148,463,0001,107,0002,117,632stderr
9Aug 26, 2026 22:2218,098158,659,249149,124,0001,096,0002,117,632stderr