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 10:21Kevin HeaveyKevin HeaveyScore: 3,739Success
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 10:223,57139,589,16028,497,0001,143,0002,113,536
2Sep 6, 2026 10:223,58039,698,88628,570,0001,151,0002,113,536
3Sep 6, 2026 10:223,58239,825,13228,581,0001,151,0002,113,536
4Sep 6, 2026 10:223,60039,960,32128,693,0001,192,0002,113,536
5Sep 6, 2026 10:223,73941,112,95329,991,0001,047,0002,113,536
6Sep 6, 2026 10:223,74041,153,38329,901,0001,145,0002,113,536
7Sep 6, 2026 10:223,81541,664,78430,464,0001,203,0002,113,536
8Sep 6, 2026 10:223,83943,230,71130,734,0001,130,0002,113,536
9Sep 6, 2026 10:223,86341,991,99130,858,0001,208,0002,113,536