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 11:36Andrew EpsteinAndrew EpsteinScore: 63,116Success
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 11:3662,985532,059,270519,753,0003,024,0002,121,728stderr
2Nov 3, 2026 11:3662,987532,328,966519,642,0003,154,0002,121,728stderr
3Nov 3, 2026 11:3663,062533,185,498521,411,0002,007,0002,121,728stderr
4Nov 3, 2026 11:3663,102533,017,561521,736,0002,012,0002,121,728stderr
5Nov 3, 2026 11:3663,116533,096,732521,850,0002,020,0002,121,728stderr
6Nov 3, 2026 11:3663,150533,972,407521,113,0003,032,0002,121,728stderr
7Nov 3, 2026 11:3663,154533,399,875522,162,0002,020,0002,121,728stderr
8Nov 3, 2026 11:3663,303535,226,584523,403,0002,017,0002,125,824stderr
9Nov 3, 2026 11:3663,304535,289,626523,424,0002,006,0002,121,728stderr