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 listMar 10, 2026 18:14Josu San MartinJosu San MartinScore: 7,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:146,56983,190,61252,502,0002,019,0002,428,928
2Mar 10, 2026 18:146,60776,277,68152,848,0001,994,0002,449,408
3Mar 10, 2026 18:146,81889,521,91953,558,0003,031,0002,330,624
4Mar 10, 2026 18:147,23381,779,89356,030,0004,002,0002,498,560
5Mar 10, 2026 18:147,23979,158,10357,078,0003,004,0002,420,736
6Mar 10, 2026 18:147,39681,661,31759,376,0002,012,0002,523,136