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 8, 2026 11:39Alexander StanovoyAlexander StanovoyScore: 41,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:3940,401345,052,102334,153,0001,182,0002,113,536
2Jul 8, 2026 11:3940,407345,112,654334,195,0001,187,0002,113,536
3Jul 8, 2026 11:3940,605346,706,166336,002,0001,023,0002,113,536
4Jul 8, 2026 11:3940,626346,857,727336,203,0001,001,0002,113,536
5Jul 8, 2026 11:3941,003350,003,219339,134,0001,197,0002,113,536
6Jul 8, 2026 11:3941,014350,159,263339,382,0001,039,0002,113,536
7Jul 8, 2026 11:3941,018350,126,950339,432,0001,025,0002,113,536
8Jul 8, 2026 11:3941,024350,282,153339,500,0001,006,0002,113,536
9Jul 8, 2026 11:3942,023358,558,770347,739,0001,058,0002,113,536