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 26, 2025 07:48Ashish AhujaAshish AhujaScore: 11,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 07:4811,789125,474,57177,881,00019,969,0002,510,848
2Aug 26, 2025 07:4811,812126,267,39075,031,00023,009,0002,408,448
3Aug 26, 2025 07:4811,820129,706,80379,277,00018,828,0002,498,560
4Aug 26, 2025 07:4811,855127,221,85376,530,00021,865,0002,486,272
5Aug 26, 2025 07:4812,167126,861,05383,986,00016,997,0002,449,408
6Aug 26, 2025 07:4812,265130,884,24583,832,00017,964,0002,494,464