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 16, 2025 13:35Ashish AhujaAshish AhujaScore: 19,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 13:3619,945197,931,268163,541,0002,006,0002,285,568
2Aug 16, 2025 13:3619,961191,061,477163,682,0001,996,0002,285,568
3Aug 16, 2025 13:3419,972193,054,198162,769,0002,995,0002,289,664
4Aug 16, 2025 13:3519,972188,755,772163,774,0001,997,0002,285,568
5Aug 16, 2025 13:3419,995192,838,308163,962,0001,999,0002,285,568
6Aug 16, 2025 13:3620,012196,618,060164,098,0002,001,0002,285,568
7Aug 16, 2025 13:3420,021190,903,123163,171,0003,003,0002,269,184
8Aug 16, 2025 13:3521,064198,008,937171,834,0002,997,0002,396,160
9Aug 16, 2025 13:3521,341204,350,340175,132,0002,001,0002,285,568