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 30, 2026 20:26wnwnScore: 3,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 20:273,29335,565,39726,332,0001,006,0002,113,536
2Jul 30, 2026 20:273,30137,090,50226,399,0001,003,0002,113,536
3Jul 30, 2026 20:273,31635,708,91326,520,0001,004,0002,113,536
4Jul 30, 2026 20:273,32836,152,47026,626,0001,002,0002,113,536
5Jul 30, 2026 20:273,37536,394,33026,975,0001,041,0002,113,536
6Jul 30, 2026 20:273,45337,758,90127,635,0001,031,0002,113,536
7Jul 30, 2026 20:273,48437,349,75927,895,0001,030,0002,113,536
8Jul 30, 2026 20:273,49037,992,98527,934,0001,033,0002,113,536
9Jul 30, 2026 20:273,49838,149,67628,018,0001,022,0002,113,536