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 25, 2025 14:26SSScore: 2,066,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 14:262,064,29817,172,492,04817,069,711,00063,965,0002,277,376
2Aug 25, 2025 14:262,065,36517,178,768,29217,073,563,00068,965,0002,260,992
3Aug 25, 2025 14:262,065,44517,177,877,48717,080,231,00062,963,0002,269,184
4Aug 25, 2025 14:262,065,51617,178,622,45517,079,816,00063,965,0002,277,376
5Aug 25, 2025 14:262,066,75017,188,501,23417,102,053,00051,972,0002,277,376
6Aug 25, 2025 14:262,070,23217,219,092,00217,107,959,00074,964,0002,277,376
7Aug 25, 2025 14:262,072,10017,229,937,59117,129,461,00068,965,0002,277,376
8Aug 25, 2025 14:262,161,59817,976,704,80017,874,296,00066,971,0002,289,664
9Aug 25, 2025 14:262,264,16018,827,314,15618,726,563,00065,966,0002,285,568