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 listAug 21, 2025 10:21Asset MalikAsset MalikScore: 63,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 10:2163,808557,447,912487,639,00041,969,0002,293,760
2Aug 21, 2025 10:2163,866552,237,044486,077,00044,007,0002,289,664
3Aug 21, 2025 10:2163,874551,960,222473,140,00057,016,0002,285,568
4Aug 21, 2025 10:2163,886554,627,114477,229,00053,025,0002,285,568
5Aug 21, 2025 10:2163,888557,486,703475,242,00055,028,0002,285,568
6Aug 21, 2025 10:2163,924557,415,963491,599,00038,968,0002,301,952
7Aug 21, 2025 10:2163,973556,223,229478,980,00051,997,0002,285,568
8Aug 21, 2025 10:2164,051559,673,511478,660,00052,962,0002,301,952
9Aug 21, 2025 10:2164,723560,719,232468,176,00069,026,0002,285,568