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 listSep 6, 2026 09:04Kevin HeaveyKevin HeaveyScore: 3,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:053,51239,211,12427,917,0001,236,0002,113,536
2Sep 6, 2026 09:053,52039,151,49127,982,0001,236,0002,113,536
3Sep 6, 2026 09:053,52139,531,90128,195,0001,036,0002,113,536
4Sep 6, 2026 09:053,52239,563,56627,995,0001,243,0002,113,536
5Sep 6, 2026 09:053,52340,394,35328,207,0001,034,0002,113,536
6Sep 6, 2026 09:053,55139,104,71028,442,0001,034,0002,113,536
7Sep 6, 2026 09:053,79542,033,85530,439,0001,066,0002,113,536
8Sep 6, 2026 09:053,81742,581,50930,504,0001,183,0002,113,536
9Sep 6, 2026 09:053,85142,642,85230,933,0001,036,0002,113,536