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 26, 2026 04:54Victor MerckléVictor MerckléScore: 4,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 04:544,07742,252,03132,690,0001,156,0002,117,632stderr
2Aug 26, 2026 04:544,08642,323,34032,833,0001,088,0002,117,632stderr
3Aug 26, 2026 04:544,15542,869,25033,467,0001,025,0002,117,632stderr
4Aug 26, 2026 04:544,16142,932,05233,487,0001,057,0002,117,632stderr
5Aug 26, 2026 04:544,19543,210,23933,817,0001,005,0002,117,632stderr
6Aug 26, 2026 04:544,24343,599,79534,059,0001,160,0002,117,632stderr
7Aug 26, 2026 04:544,26943,789,16234,430,0001,007,0002,117,632stderr
8Aug 26, 2026 04:544,34044,526,90834,880,0001,143,0002,117,632stderr
9Aug 26, 2026 04:544,46045,419,77735,861,0001,158,0002,117,632stderr