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 14:27Victor MerckléVictor MerckléScore: 4,260Success
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 14:284,20143,292,94933,759,0001,116,0002,117,632stderr
2Aug 11, 2026 14:284,21743,384,82433,971,0001,038,0002,117,632stderr
3Aug 11, 2026 14:284,22143,429,30934,012,0001,025,0002,117,632stderr
4Aug 11, 2026 14:284,23243,494,50134,067,0001,061,0002,117,632stderr
5Aug 11, 2026 14:284,26043,711,87834,334,0001,025,0002,117,632stderr
6Aug 11, 2026 14:284,28845,020,24834,559,0001,039,0002,117,632stderr
7Aug 11, 2026 14:284,29644,049,58334,643,0001,016,0002,117,632stderr
8Aug 11, 2026 14:284,33744,411,88834,886,0001,113,0002,117,632stderr
9Aug 11, 2026 14:284,44845,323,60135,892,0001,034,0002,117,632stderr