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 15:54boop34boop34Score: 9,019Success
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 15:548,98184,428,17273,319,0001,231,0002,113,536
2Aug 25, 2026 15:549,00184,553,60573,593,0001,119,0002,113,536
3Aug 25, 2026 15:549,00484,677,01573,509,0001,227,0002,113,536
4Aug 25, 2026 15:549,01585,866,73473,700,0001,130,0002,113,536
5Aug 25, 2026 15:549,01984,715,71973,650,0001,214,0002,113,536
6Aug 25, 2026 15:549,02484,828,92473,768,0001,138,0002,113,536
7Aug 25, 2026 15:549,02684,794,20373,784,0001,136,0002,113,536
8Aug 25, 2026 15:549,03784,901,12873,897,0001,113,0002,113,536
9Aug 25, 2026 15:549,05184,955,64573,995,0001,129,0002,113,536