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 16:40sheryllynn24sheryllynn24Score: 8,526Success
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 16:408,06491,725,81065,932,000998,0002,527,232
2Sep 21, 2025 16:408,07491,218,09965,017,0002,000,0002,387,968
3Sep 21, 2025 16:408,07694,416,06565,029,0002,000,0002,289,664
4Sep 21, 2025 16:408,491100,070,36169,468,0001,006,0002,523,136
5Sep 21, 2025 16:408,504102,849,77269,572,0001,008,0002,523,136
6Sep 21, 2025 16:408,51999,700,58168,687,0002,020,0002,523,136
7Sep 21, 2025 16:408,52696,888,09968,776,0001,993,0002,265,088
8Sep 21, 2025 16:408,52899,425,93668,787,0001,993,0002,523,136
9Sep 21, 2025 16:408,53394,713,13269,827,000997,0002,289,664
10Sep 21, 2025 16:408,534102,007,56969,834,000997,0002,289,664
11Sep 21, 2025 16:408,53595,697,43268,844,0001,995,0002,514,944
12Sep 21, 2025 16:409,310106,984,84676,268,0001,003,0002,523,136