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 listMay 10, 2026 04:01Josu San MartinJosu San MartinScore: 4,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:014,76555,913,12138,447,0001,103,0002,535,424
2May 10, 2026 04:014,79556,869,36538,764,0001,041,0002,547,712
3May 10, 2026 04:014,83058,347,76438,966,0001,128,0002,555,904
4May 10, 2026 04:014,84355,200,34639,177,0001,028,0002,555,904
5May 10, 2026 04:014,84352,981,24839,147,0001,051,0002,547,712
6May 10, 2026 04:014,84955,290,65439,218,0001,034,0002,551,808
7May 10, 2026 04:014,85356,487,59039,227,0001,054,0002,543,616
8May 10, 2026 04:014,88857,927,27839,441,0001,135,0002,555,904
9May 10, 2026 04:014,96456,651,66440,094,0001,110,0002,551,808