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 19, 2026 16:19Victor MerckléVictor MerckléScore: 6,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:196,82564,451,50855,629,0001,019,0002,113,536
2May 19, 2026 16:196,82565,379,07255,632,0001,022,0002,113,536
3May 19, 2026 16:196,82665,940,20555,636,0001,022,0002,113,536
4May 19, 2026 16:196,89567,998,90156,212,0001,024,0002,113,536
5May 19, 2026 16:196,93668,293,50256,542,0001,031,0002,113,536
6May 19, 2026 16:196,93765,382,08056,558,0001,022,0002,113,536
7May 19, 2026 16:196,98967,926,20556,989,0001,025,0002,113,536
8May 19, 2026 16:197,01769,706,43557,214,0001,029,0002,113,536
9May 19, 2026 16:197,02667,705,98457,296,0001,024,0002,113,536