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 31, 2026 01:01Josu San MartinJosu San MartinScore: 4,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:114,35144,558,50635,090,0001,027,0002,113,536
2Aug 31, 2026 01:114,35344,705,13935,110,0001,027,0002,113,536
3Aug 31, 2026 01:114,35644,543,43935,127,0001,028,0002,113,536
4Aug 31, 2026 01:114,37644,697,03134,298,0002,030,0002,113,536
5Aug 31, 2026 01:114,37944,883,90334,346,0002,002,0002,113,536
6Aug 31, 2026 01:114,38344,853,27634,382,0002,004,0002,113,536
7Aug 31, 2026 01:114,38746,336,18534,364,0002,049,0002,113,536
8Aug 31, 2026 01:114,38844,893,48135,396,0001,028,0002,113,536
9Aug 31, 2026 01:114,38944,828,47635,402,0001,028,0002,113,536