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 listNov 3, 2026 08:05Andrew EpsteinAndrew EpsteinScore: 95,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 08:1195,359800,791,217789,461,0002,019,0002,121,728stderr
2Nov 3, 2026 08:1195,401801,637,606789,830,0002,004,0002,121,728stderr
3Nov 3, 2026 08:1195,527802,251,978790,868,0002,013,0002,121,728stderr
4Nov 3, 2026 08:1195,702803,710,201791,329,0003,001,0002,121,728stderr
5Nov 3, 2026 08:1195,768804,703,343791,866,0003,013,0002,121,728stderr
6Nov 3, 2026 08:1195,788804,802,351793,042,0002,003,0002,121,728stderr
7Nov 3, 2026 08:1195,816804,845,286792,134,0003,142,0002,121,728stderr
8Nov 3, 2026 08:1195,841805,327,429793,485,0002,003,0002,121,728stderr
9Nov 3, 2026 08:1195,880805,565,084793,799,0002,005,0002,121,728stderr