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 listFeb 16, 2026 18:43wnwnScore: 8,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:438,32989,536,95866,126,0003,005,0002,371,584
2Feb 16, 2026 18:438,33792,741,08166,187,0003,008,0002,498,560
3Feb 16, 2026 18:438,41399,548,91167,836,0001,995,0002,473,984
4Feb 16, 2026 18:438,41897,528,23066,875,0002,994,0002,330,624
5Feb 16, 2026 18:438,42192,684,08066,899,0002,995,0002,338,816
6Feb 16, 2026 18:438,44598,706,51068,091,0002,002,0002,310,144
7Feb 16, 2026 18:438,48591,701,41166,398,0004,024,0002,482,176
8Feb 16, 2026 18:438,49196,751,93266,449,0004,027,0002,498,560
9Feb 16, 2026 18:438,56095,988,52569,045,0002,001,0002,363,392