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 listAug 27, 2026 02:28Victor MerckléVictor MerckléScore: 4,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:294,44345,137,17935,800,0001,081,0002,117,632stderr
2Aug 27, 2026 02:294,44345,162,20035,795,0001,084,0002,117,632stderr
3Aug 27, 2026 02:294,44845,229,87035,853,0001,069,0002,117,632stderr
4Aug 27, 2026 02:294,45046,058,45735,778,0001,157,0002,117,632stderr
5Aug 27, 2026 02:294,46745,394,01835,916,0001,167,0002,117,632stderr
6Aug 27, 2026 02:294,50345,735,91636,290,0001,089,0002,117,632stderr
7Aug 27, 2026 02:294,53145,925,67936,472,0001,141,0002,117,632stderr
8Aug 27, 2026 02:294,54946,100,46436,593,0001,166,0002,117,632stderr
9Aug 27, 2026 02:294,61546,650,69337,151,0001,160,0002,117,632stderr