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 12:19Victor MerckléVictor MerckléScore: 4,366Success
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 12:204,32844,192,86534,791,0001,139,0002,117,632stderr
2Aug 11, 2026 12:204,33444,293,38334,834,0001,142,0002,117,632stderr
3Aug 11, 2026 12:204,35444,356,98835,058,0001,085,0002,117,632stderr
4Aug 11, 2026 12:204,36544,707,20135,134,0001,102,0002,117,632stderr
5Aug 11, 2026 12:204,36644,610,51735,225,0001,015,0002,117,632stderr
6Aug 11, 2026 12:204,51345,727,62436,369,0001,095,0002,117,632stderr
7Aug 11, 2026 12:204,53045,974,14036,483,0001,120,0002,117,632stderr
8Aug 11, 2026 12:204,53745,951,62936,554,0001,106,0002,117,632stderr
9Aug 11, 2026 12:204,59146,402,86737,018,0001,088,0002,117,632stderr