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 28, 2025 07:24sheryllynn24sheryllynn24Score: 6,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2025 07:246,18180,853,04849,288,0002,011,0002,289,664
2Sep 28, 2025 07:246,18581,067,07349,323,0002,013,0002,289,664
3Sep 28, 2025 07:246,19280,677,18449,382,0002,015,0002,265,088
4Sep 28, 2025 07:246,19276,112,11849,375,0002,015,0002,289,664
5Sep 28, 2025 07:246,19872,599,47650,432,0001,008,0002,289,664
6Sep 28, 2025 07:246,20076,539,36849,440,0002,017,0002,289,664
7Sep 28, 2025 07:246,21176,667,88450,541,0001,010,0002,527,232
8Sep 28, 2025 07:246,22684,060,80250,666,0001,013,0002,281,472
9Sep 28, 2025 07:246,25780,998,61549,934,0001,997,0002,269,184
10Sep 28, 2025 07:246,30578,917,04651,328,0001,006,0002,289,664
11Sep 28, 2025 07:246,32072,437,01651,445,0001,008,0002,379,776
12Sep 28, 2025 07:246,33876,888,51151,591,0001,011,0002,527,232