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 listDec 4, 2025 23:57Dane UrbanDane UrbanScore: 2,065,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 23:572,063,50017,159,000,32217,049,080,00077,968,0002,289,664
2Dec 4, 2025 23:572,063,99917,161,182,96017,058,220,00072,970,0002,277,376
3Dec 4, 2025 23:572,065,63517,179,180,92617,082,795,00061,973,0002,277,376
4Dec 4, 2025 23:572,065,66317,175,806,38817,075,040,00069,967,0002,289,664
5Dec 4, 2025 23:572,065,70217,177,242,79717,077,354,00067,973,0002,277,376
6Dec 4, 2025 23:572,066,96217,187,840,40617,067,831,00087,957,0002,277,376
7Dec 4, 2025 23:572,067,70617,195,259,81617,097,988,00063,970,0002,277,376
8Dec 4, 2025 23:572,079,59017,292,460,35017,185,629,00074,967,0002,277,376
9Dec 4, 2025 23:572,088,59817,366,932,63817,279,394,00055,972,0002,277,376