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 31, 2026 16:14boop34boop34Score: 16,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 16:1416,357145,616,602134,759,0001,006,0002,113,536
2Jul 31, 2026 16:1416,362145,726,027134,802,0001,006,0002,113,536
3Jul 31, 2026 16:1416,371145,809,474134,873,0001,007,0002,113,536
4Jul 31, 2026 16:1416,418146,202,445135,251,0001,021,0002,113,536
5Jul 31, 2026 16:1416,447146,442,908135,507,0001,008,0002,113,536
6Jul 31, 2026 16:1416,500146,828,860135,943,0001,007,0002,113,536
7Jul 31, 2026 16:1416,514146,984,248136,048,0001,019,0002,113,536
8Jul 31, 2026 16:1416,540147,156,742136,277,0001,005,0002,113,536
9Jul 31, 2026 16:1416,549147,198,425136,353,0001,007,0002,113,536