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 listNov 3, 2025 16:20prashantbits01prashantbits01Score: 2,066,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 16:202,058,12517,120,071,71617,009,475,00072,963,0002,277,376
2Nov 3, 2025 16:202,063,42917,163,170,50217,053,495,00072,963,0002,277,376
3Nov 3, 2025 16:202,065,56917,179,944,79117,078,252,00065,970,0002,277,376
4Nov 3, 2025 16:202,066,05017,179,470,84617,076,255,00071,963,0002,265,088
5Nov 3, 2025 16:202,066,22417,180,951,18417,093,691,00055,972,0002,289,664
6Nov 3, 2025 16:202,066,86117,186,744,92817,088,981,00065,969,0002,260,992
7Nov 3, 2025 16:202,068,22817,203,423,85417,102,331,00063,963,0002,289,664
8Nov 3, 2025 16:202,071,80117,230,720,34617,124,989,00070,962,0002,277,376
9Nov 3, 2025 16:202,142,26217,815,830,50617,723,805,00056,973,0002,285,568