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 21, 2026 10:54Kevin HeaveyKevin HeaveyScore: 3,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 10:593,56339,232,16828,536,0001,045,0002,113,536
2Jul 21, 2026 10:593,57139,300,67328,419,0001,226,0002,113,536
3Jul 21, 2026 10:593,58642,375,28728,543,0001,227,0002,113,536
4Jul 21, 2026 10:593,59048,189,79028,759,0001,045,0002,113,536
5Jul 21, 2026 10:593,61443,162,01128,955,0001,045,0002,117,632
6Jul 21, 2026 10:593,73740,786,23129,803,0001,219,0002,113,536
7Jul 21, 2026 10:593,77741,034,83230,143,0001,210,0002,113,536
8Jul 21, 2026 10:593,81341,947,17630,604,0001,044,0002,113,536
9Jul 21, 2026 10:593,84142,837,90230,643,0001,245,0002,113,536