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 listSep 21, 2025 07:53sheryllynn24sheryllynn24Score: 9,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 07:538,84594,727,76572,405,0001,005,0002,510,848
2Sep 21, 2025 07:538,96598,560,58873,407,0001,005,0002,523,136
3Sep 21, 2025 07:538,975103,416,23673,489,0001,006,0002,510,848
4Sep 21, 2025 07:539,341106,998,79376,522,0001,006,0002,289,664
5Sep 21, 2025 07:539,343105,693,22076,544,0001,007,0002,510,848
6Sep 21, 2025 07:539,345103,247,50576,556,0001,007,0002,527,232
7Sep 21, 2025 07:539,372104,347,85375,791,0001,994,0002,527,232
8Sep 21, 2025 07:539,455107,146,05976,468,0002,012,0002,514,944
9Sep 21, 2025 07:539,456101,895,85577,481,0001,006,0002,514,944
10Sep 21, 2025 07:539,459102,234,72977,507,0001,006,0002,523,136
11Sep 21, 2025 07:539,472110,633,71477,612,0001,007,0002,289,664
12Sep 21, 2025 07:539,476107,463,91077,639,0001,008,0002,523,136