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 07:19Andrew EpsteinAndrew EpsteinScore: 30,457Success
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 07:1930,211260,116,326248,740,0002,019,0002,121,728stderr
2Nov 3, 2026 07:1930,354261,196,230249,940,0002,006,0002,121,728stderr
3Nov 3, 2026 07:1930,397261,953,995250,288,0002,014,0002,121,728stderr
4Nov 3, 2026 07:1930,407263,585,318250,370,0002,014,0002,121,728stderr
5Nov 3, 2026 07:1930,457262,643,107250,786,0002,010,0002,121,728stderr
6Nov 3, 2026 07:1930,468262,665,522250,886,0002,006,0002,121,728stderr
7Nov 3, 2026 07:1930,475262,286,135250,926,0002,018,0002,121,728stderr
8Nov 3, 2026 07:1930,491262,873,787251,063,0002,017,0002,121,728stderr
9Nov 3, 2026 07:1930,617263,441,740252,109,0002,014,0002,121,728stderr