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:23Andrew EpsteinAndrew EpsteinScore: 73,040Success
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:2572,880614,699,900602,870,0002,036,0002,121,728stderr
2Nov 3, 2026 08:2573,017615,844,922604,010,0002,034,0002,121,728stderr
3Nov 3, 2026 08:2573,021615,369,528604,043,0002,035,0002,121,728stderr
4Nov 3, 2026 08:2573,032615,409,928604,153,0002,017,0002,121,728stderr
5Nov 3, 2026 08:2573,040615,565,692604,226,0002,008,0002,121,728stderr
6Nov 3, 2026 08:2573,156616,957,588605,163,0002,035,0002,121,728stderr
7Nov 3, 2026 08:2573,234617,527,864605,828,0002,019,0002,121,728stderr
8Nov 3, 2026 08:2573,290618,130,931606,268,0002,042,0002,121,728stderr
9Nov 3, 2026 08:2573,460619,509,677607,699,0002,024,0002,121,728stderr