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 8, 2025 15:22Ashish AhujaAshish AhujaScore: 2,694,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 15:212,690,77827,853,345,13020,370,747,0001,962,709,0002,301,952
2Aug 8, 2025 15:212,693,98228,376,228,20220,357,687,0002,002,362,0002,461,696
3Aug 8, 2025 15:212,694,20728,276,165,67620,331,549,0002,030,365,0002,310,144
4Aug 8, 2025 15:222,694,39128,354,270,37320,349,360,0002,014,086,0002,416,640
5Aug 8, 2025 15:222,694,75628,355,575,02320,340,066,0002,026,412,0002,392,064
6Aug 8, 2025 15:222,712,55829,877,453,93020,550,271,0001,963,958,0002,412,544