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:02Andrew EpsteinAndrew EpsteinScore: 10,085Success
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:039,97692,026,23180,934,0001,871,00028,672stderr
2Nov 3, 2026 07:0310,04592,566,55581,487,0001,889,00028,672stderr
3Nov 3, 2026 07:0310,04792,676,39381,527,0001,865,00028,672stderr
4Nov 3, 2026 07:0310,05992,830,55981,620,0001,875,00028,672stderr
5Nov 3, 2026 07:0310,08593,004,55181,834,0001,874,00028,672stderr
6Nov 3, 2026 07:0310,09293,079,32781,892,0001,877,00028,672stderr
7Nov 3, 2026 07:0310,09793,121,46781,940,0001,871,00028,672stderr
8Nov 3, 2026 07:0310,10093,142,27981,777,0002,059,0002,121,728stderr
9Nov 3, 2026 07:0310,12093,332,22282,120,0001,884,00028,672stderr