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 00:42Victor MerckléVictor MerckléScore: 4,353Success
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 00:434,30944,770,71634,624,0001,143,0002,117,632stderr
2Aug 27, 2026 00:434,31344,140,53434,655,0001,151,0002,117,632stderr
3Aug 27, 2026 00:434,32044,191,75834,757,0001,100,0002,117,632stderr
4Aug 27, 2026 00:434,33744,327,11434,922,0001,078,0002,117,632stderr
5Aug 27, 2026 00:434,35344,718,33634,975,0001,158,0002,117,632stderr
6Aug 27, 2026 00:434,37945,368,73335,128,0001,221,0002,117,632stderr
7Aug 27, 2026 00:434,42245,648,74835,566,0001,137,0002,117,632stderr
8Aug 27, 2026 00:434,48245,671,10436,126,0001,081,0002,117,632stderr
9Aug 27, 2026 00:434,50146,275,04436,260,0001,102,0002,117,632stderr