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 1, 2026 06:32timothygktimothygkScore: 10,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 06:379,91393,175,73171,904,00010,374,0002,150,400stderr
2Nov 1, 2026 06:379,97395,553,97872,433,00010,347,0002,150,400stderr
3Nov 1, 2026 06:3710,05494,337,58672,361,00011,088,0002,150,400stderr
4Nov 1, 2026 06:3710,06094,394,24073,107,00010,398,0002,150,400stderr
5Nov 1, 2026 06:3710,08694,581,74572,494,00011,227,0002,150,400stderr
6Nov 1, 2026 06:3710,26696,173,42574,781,00010,428,0002,150,400stderr
7Nov 1, 2026 06:3710,30096,357,65875,201,00010,289,0002,150,400stderr
8Nov 1, 2026 06:3710,46398,267,03576,686,00010,165,0002,150,400stderr
9Nov 1, 2026 06:3710,68799,580,28577,343,00011,364,0002,150,400stderr