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 18:59Ashish AhujaAshish AhujaScore: 20,240Success
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 18:5919,979188,911,367160,829,0004,994,0002,404,352
2Aug 16, 2025 18:5920,217190,705,084163,802,0003,995,0002,441,216
3Aug 16, 2025 18:5920,218190,577,130163,814,0003,995,0002,408,448
4Aug 16, 2025 18:5920,240188,663,780163,991,0003,999,0002,412,544
5Aug 16, 2025 18:5920,275189,673,194163,277,0005,008,0002,449,408
6Aug 16, 2025 18:5920,283197,396,224163,340,0005,010,0002,510,848