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 listJul 2, 2026 11:47Victor MerckléVictor MerckléScore: 4,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:494,36943,976,23635,164,0001,099,0002,117,632stderr
2Jul 2, 2026 11:494,36944,179,29235,131,0001,138,0002,117,632stderr
3Jul 2, 2026 11:494,37044,295,62035,121,0001,153,0002,117,632stderr
4Jul 2, 2026 11:494,38644,182,22635,243,0001,165,0002,117,632stderr
5Jul 2, 2026 11:494,39344,408,22935,328,0001,139,0002,117,632stderr
6Jul 2, 2026 11:494,39844,216,98735,394,0001,110,0002,117,632stderr
7Jul 2, 2026 11:494,39944,194,09335,427,0001,086,0002,117,632stderr
8Jul 2, 2026 11:494,42544,434,10835,627,0001,105,0002,117,632stderr
9Jul 2, 2026 11:494,43144,502,79235,724,0001,055,0002,117,632stderr