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 11, 2026 11:49Victor MerckléVictor MerckléScore: 3,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:503,85541,493,17030,813,0001,187,0002,117,632stderr
2Aug 11, 2026 11:503,85740,388,63030,920,0001,101,0002,117,632stderr
3Aug 11, 2026 11:503,86140,353,44330,951,0001,103,0002,117,632stderr
4Aug 11, 2026 11:503,86740,399,99930,987,0001,110,0002,117,632stderr
5Aug 11, 2026 11:503,88740,546,10831,169,0001,100,0002,117,632stderr
6Aug 11, 2026 11:503,89140,684,45831,088,0001,209,0002,117,632stderr
7Aug 11, 2026 11:503,89640,515,49131,227,0001,110,0002,117,632stderr
8Aug 11, 2026 11:503,92540,910,71131,457,0001,121,0002,117,632stderr
9Aug 11, 2026 11:504,02941,753,48732,316,0001,126,0002,117,632stderr