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 12, 2026 23:28Victor MerckléVictor MerckléScore: 3,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 23:293,77639,826,25430,213,0001,135,0002,117,632stderr
2Aug 12, 2026 23:293,77739,744,85030,280,0001,077,0002,117,632stderr
3Aug 12, 2026 23:293,78239,785,68330,319,0001,079,0002,117,632stderr
4Aug 12, 2026 23:293,79839,963,25530,447,0001,081,0002,117,632stderr
5Aug 12, 2026 23:293,80139,905,90830,470,0001,083,0002,117,632stderr
6Aug 12, 2026 23:293,80640,040,79330,521,0001,074,0002,117,632stderr
7Aug 12, 2026 23:293,82540,155,54230,682,0001,066,0002,117,632stderr
8Aug 12, 2026 23:293,82640,164,11230,610,0001,146,0002,117,632stderr
9Aug 12, 2026 23:293,84640,265,55730,859,0001,064,0002,117,632stderr