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 12:32Victor MerckléVictor MerckléScore: 3,807Success
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 12:323,75039,521,95629,985,0001,140,0002,117,632stderr
2Aug 12, 2026 12:323,78240,470,88630,242,0001,152,0002,117,632stderr
3Aug 12, 2026 12:323,78739,849,74330,337,0001,098,0002,117,632stderr
4Aug 12, 2026 12:323,80739,971,24830,522,0001,078,0002,117,632stderr
5Aug 12, 2026 12:323,80741,679,47830,508,0001,095,0002,117,632stderr
6Aug 12, 2026 12:323,81940,112,45830,635,0001,068,0002,117,632stderr
7Aug 12, 2026 12:323,82740,175,15330,683,0001,083,0002,117,632stderr
8Aug 12, 2026 12:323,87340,569,56730,983,0001,166,0002,117,632stderr
9Aug 12, 2026 12:323,91040,839,87031,405,0001,054,0002,117,632stderr