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 22:53Victor MerckléVictor MerckléScore: 3,769Success
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 22:543,74239,605,05829,850,0001,215,0002,117,632stderr
2Aug 12, 2026 22:543,74340,152,75629,926,0001,141,0002,117,632stderr
3Aug 12, 2026 22:543,75239,591,13830,036,0001,113,0002,117,632stderr
4Aug 12, 2026 22:543,76239,654,00830,126,0001,102,0002,117,632stderr
5Aug 12, 2026 22:543,76939,745,33430,160,0001,127,0002,117,632stderr
6Aug 12, 2026 22:543,79739,874,29330,441,0001,077,0002,117,632stderr
7Aug 12, 2026 22:543,81240,144,27730,451,0001,196,0002,117,632stderr
8Aug 12, 2026 22:543,84040,416,32730,762,0001,117,0002,117,632stderr
9Aug 12, 2026 22:543,90740,849,89831,320,0001,111,0002,117,632stderr