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 3, 2026 17:11Victor MerckléVictor MerckléScore: 4,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:124,71247,621,97438,084,0001,033,0002,113,536
2Sep 3, 2026 17:124,79348,418,61938,664,0001,121,0002,113,536
3Sep 3, 2026 17:124,79748,231,79338,785,0001,033,0002,113,536
4Sep 3, 2026 17:124,81749,114,52938,944,0001,042,0002,113,536
5Sep 3, 2026 17:124,83348,517,39139,090,0001,032,0002,113,536
6Sep 3, 2026 17:124,92550,077,17739,767,0001,117,0002,113,536
7Sep 3, 2026 17:124,92549,328,22239,757,0001,127,0002,113,536
8Sep 3, 2026 17:124,92849,493,96939,780,0001,125,0002,113,536
9Sep 3, 2026 17:124,94749,718,16540,051,0001,016,0002,113,536