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 22, 2025 14:24Gjorgji KjosevGjorgji KjosevScore: 395,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 14:24392,2673,288,440,0113,197,853,00057,961,0002,281,472
2Aug 22, 2025 14:24392,3463,281,857,5753,183,504,00072,965,0002,281,472
3Aug 22, 2025 14:24393,7333,290,259,1033,206,023,00061,961,0002,281,472
4Aug 22, 2025 14:24394,9643,306,945,3653,218,237,00059,967,0002,281,472
5Aug 22, 2025 14:24395,3203,303,700,8823,211,199,00069,960,0002,355,200
6Aug 22, 2025 14:24396,5513,321,028,7903,227,407,00063,968,0002,281,472
7Aug 22, 2025 14:24399,8003,342,571,9643,256,374,00061,969,0002,281,472
8Aug 22, 2025 14:24399,9783,350,812,0783,248,845,00070,974,0002,285,568
9Aug 22, 2025 14:24418,5263,502,991,5943,417,801,00055,964,0002,494,464