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 listSep 1, 2026 04:14Victor MerckléVictor MerckléScore: 3,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 04:183,64839,363,61329,149,0001,135,0002,117,632stderr
2Sep 1, 2026 04:183,66238,775,84229,247,0001,155,0002,117,632stderr
3Sep 1, 2026 04:183,66938,824,72229,323,0001,131,0002,117,632stderr
4Sep 1, 2026 04:183,66938,857,10929,294,0001,160,0002,117,632stderr
5Sep 1, 2026 04:183,68439,410,05629,438,0001,142,0002,117,632stderr
6Sep 1, 2026 04:183,69439,741,35529,473,0001,189,0002,117,632stderr
7Sep 1, 2026 04:183,69839,108,64329,525,0001,169,0002,117,632stderr
8Sep 1, 2026 04:183,72639,465,31629,783,0001,149,0002,117,632stderr
9Sep 1, 2026 04:183,75440,208,95630,001,0001,165,0002,117,632stderr