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 listJul 19, 2026 13:19Kevin HeaveyKevin HeaveyScore: 3,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 13:203,64841,385,71229,241,0001,040,0002,117,632
2Jul 19, 2026 13:203,64939,966,46129,047,0001,244,0002,117,632
3Jul 19, 2026 13:203,67140,532,07829,236,0001,237,0002,117,632
4Jul 19, 2026 13:203,71440,601,11829,608,0001,221,0002,117,632
5Jul 19, 2026 13:203,82541,593,10430,550,0001,203,0002,117,632
6Jul 19, 2026 13:203,82941,483,27230,558,0001,226,0002,117,632
7Jul 19, 2026 13:203,86341,884,26930,835,0001,236,0002,117,632
8Jul 19, 2026 13:203,89742,039,33431,143,0001,206,0002,117,632
9Jul 19, 2026 13:203,96742,619,09531,892,0001,040,0002,117,632