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 18, 2026 17:17Kevin HeaveyKevin HeaveyScore: 3,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 17:243,64339,993,36629,200,0001,045,0002,113,536
2Jul 18, 2026 17:243,68740,419,95429,583,0001,025,0002,113,536
3Jul 18, 2026 17:243,70140,526,93629,675,0001,048,0002,113,536
4Jul 18, 2026 17:243,70440,577,74429,703,0001,047,0002,113,536
5Jul 18, 2026 17:243,71840,626,78629,819,0001,048,0002,113,536
6Jul 18, 2026 17:243,96250,725,71631,844,0001,045,0002,113,536
7Jul 18, 2026 17:243,96642,690,53031,870,0001,050,0002,113,536
8Jul 18, 2026 17:243,98542,837,32332,034,0001,042,0002,113,536
9Jul 18, 2026 17:243,99142,973,03232,092,0001,041,0002,113,536