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 19:27boop34boop34Score: 34,092Success
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 19:2732,781281,924,289270,985,0001,099,0002,113,536
2Jul 30, 2026 19:2732,791282,085,467271,053,0001,114,0002,113,536
3Jul 30, 2026 19:2732,800283,418,250271,123,0001,118,0002,113,536
4Jul 30, 2026 19:2733,297286,196,197275,240,0001,131,0002,113,536
5Jul 30, 2026 19:2734,092292,840,442281,867,0001,098,0002,113,536
6Jul 30, 2026 19:2734,096292,892,451281,824,0001,181,0002,113,536
7Jul 30, 2026 19:2734,096292,957,198281,832,0001,165,0002,113,536
8Jul 30, 2026 19:2734,182293,562,555282,713,0001,005,0002,113,536
9Jul 30, 2026 19:2734,990300,297,401289,227,0001,195,0002,113,536