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 listDec 27, 2025 16:14Josu San MartinJosu San MartinScore: 59,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 16:1659,183511,797,990491,223,00002,363,392
2Dec 27, 2025 16:1459,204519,100,781490,391,0001,000,0002,457,600
3Dec 27, 2025 16:1659,207516,904,103491,421,00002,363,392
4Dec 27, 2025 16:1659,224521,771,316489,560,0001,998,0002,285,568
5Dec 27, 2025 16:1459,232522,537,416489,627,0001,998,0002,289,664
6Dec 27, 2025 16:1459,398515,971,539489,002,0004,000,0002,359,296