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 listJul 16, 2026 09:00boop34boop34Score: 9,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 09:018,98884,210,35473,596,0001,011,0002,113,536
2Jul 16, 2026 09:018,99284,256,56673,628,0001,008,0002,113,536
3Jul 16, 2026 09:018,99784,266,47173,650,0001,030,0002,113,536
4Jul 16, 2026 09:019,00184,252,50873,707,0001,007,0002,113,536
5Jul 16, 2026 09:019,00984,400,10673,743,0001,032,0002,113,536
6Jul 16, 2026 09:019,01184,327,34873,789,0001,009,0002,113,536
7Jul 16, 2026 09:019,02784,579,07273,908,0001,019,0002,113,536
8Jul 16, 2026 09:019,03384,536,76973,965,0001,017,0002,113,536
9Jul 16, 2026 09:019,17287,026,54075,125,0001,008,0002,113,536