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 25, 2026 00:53Victor MerckléVictor MerckléScore: 4,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:544,17542,841,87133,574,0001,084,0002,117,632stderr
2Aug 25, 2026 00:544,18242,875,42933,584,0001,131,0002,117,632stderr
3Aug 25, 2026 00:544,19442,984,85333,688,0001,129,0002,117,632stderr
4Aug 25, 2026 00:544,19643,098,21933,799,0001,033,0002,117,632stderr
5Aug 25, 2026 00:544,21043,996,89833,872,0001,072,0002,117,632stderr
6Aug 25, 2026 00:544,21143,392,00333,899,0001,054,0002,117,632stderr
7Aug 25, 2026 00:544,21143,131,26933,832,0001,124,0002,117,632stderr
8Aug 25, 2026 00:544,21443,098,03833,858,0001,125,0002,117,632stderr
9Aug 25, 2026 00:544,30844,173,79634,652,0001,105,0002,117,632stderr