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 15, 2026 14:51Jarry XiaoJarry XiaoScore: 11,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 14:5211,712106,824,09294,007,0003,206,0002,121,728stderr
2Jul 15, 2026 14:5211,713106,840,80993,951,0003,274,0002,121,728stderr
3Jul 15, 2026 14:5211,716106,846,19594,022,0003,223,0002,121,728stderr
4Jul 15, 2026 14:5211,719107,268,50594,225,0003,050,0002,121,728stderr
5Jul 15, 2026 14:5211,720106,864,80894,049,0003,234,0002,121,728stderr
6Jul 15, 2026 14:5211,721106,911,75394,042,0003,248,0002,121,728stderr
7Jul 15, 2026 14:5211,726107,048,74794,108,0003,221,0002,121,728stderr
8Jul 15, 2026 14:5211,745107,191,61994,256,0003,229,0002,121,728stderr
9Jul 15, 2026 14:5212,258111,355,80998,493,0003,254,0002,121,728stderr