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 26, 2026 04:04Victor MerckléVictor MerckléScore: 3,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 04:043,88040,675,20731,084,0001,128,0002,117,632stderr
2Aug 26, 2026 04:043,90441,444,74231,287,0001,121,0002,117,632stderr
3Aug 26, 2026 04:043,90840,799,92231,343,0001,098,0002,117,632stderr
4Aug 26, 2026 04:043,91140,865,00231,360,0001,109,0002,117,632stderr
5Aug 26, 2026 04:043,91440,856,56431,431,0001,057,0002,117,632stderr
6Aug 26, 2026 04:043,92141,007,92231,371,0001,175,0002,117,632stderr
7Aug 26, 2026 04:043,94141,080,81431,652,0001,059,0002,117,632stderr
8Aug 26, 2026 04:043,94441,167,92831,638,0001,104,0002,117,632stderr
9Aug 26, 2026 04:043,95141,195,36831,674,0001,127,0002,117,632stderr