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 13, 2025 18:56Tony SolomonikTony SolomonikScore: 66,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 18:5666,593576,470,087482,755,00069,964,0002,478,080
2Sep 13, 2025 18:5666,659579,326,835486,240,00067,033,0002,285,568
3Sep 13, 2025 18:5666,663584,374,695500,276,00053,029,0002,351,104
4Sep 13, 2025 18:5666,688580,501,212486,568,00066,940,0002,285,568
5Sep 13, 2025 18:5666,706580,551,639487,704,00065,959,0002,285,568
6Sep 13, 2025 18:5666,715575,617,591492,763,00060,970,0002,285,568
7Sep 13, 2025 18:5666,721581,888,400491,806,00061,975,0002,359,296
8Sep 13, 2025 18:5666,747578,197,711501,000,00053,000,0002,285,568
9Sep 13, 2025 18:5666,817587,747,288494,624,00059,954,0002,285,568