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 05:38Andrew EpsteinAndrew EpsteinScore: 34,023Success
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 05:4133,913291,283,310279,469,0002,014,0002,121,728stderr
2Nov 3, 2026 05:4133,926291,388,618279,578,0002,008,0002,121,728stderr
3Nov 3, 2026 05:4133,973291,670,634279,967,0002,016,0002,121,728stderr
4Nov 3, 2026 05:4133,999291,943,700280,084,0002,114,0002,121,728stderr
5Nov 3, 2026 05:4134,023292,191,500280,381,0002,012,0002,121,728stderr
6Nov 3, 2026 05:4134,037292,337,932280,503,0002,011,0002,121,728stderr
7Nov 3, 2026 05:4134,107292,335,239281,084,0002,009,0002,121,728stderr
8Nov 3, 2026 05:4134,122293,116,586281,202,0002,013,0002,121,728stderr
9Nov 3, 2026 05:4134,151294,693,334281,391,0002,068,0002,121,728stderr