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 12, 2026 01:18Victor MerckléVictor MerckléScore: 10,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:1910,09592,891,84982,698,0001,094,0002,113,536
2May 12, 2026 01:1910,09893,194,06882,723,0001,098,0002,113,536
3May 12, 2026 01:1910,10195,266,58882,745,0001,101,0002,113,536
4May 12, 2026 01:1910,10894,046,45582,735,0001,164,0002,113,536
5May 12, 2026 01:1910,11093,234,98982,735,0001,178,0002,113,536
6May 12, 2026 01:1910,11294,166,34082,927,0001,003,0002,113,536
7May 12, 2026 01:1910,11394,959,83082,773,0001,165,0002,113,536
8May 12, 2026 01:1910,11793,120,92082,801,0001,177,0002,113,536
9May 12, 2026 01:1910,15995,745,60383,232,0001,092,0002,113,536