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 10, 2026 09:04wnwnScore: 3,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:053,31235,364,26026,476,0001,015,0002,113,536
2Jul 10, 2026 09:053,32435,569,17826,589,0001,005,0002,113,536
3Jul 10, 2026 09:053,32635,484,21426,577,0001,032,0002,113,536
4Jul 10, 2026 09:053,33635,612,39626,661,0001,031,0002,113,536
5Jul 10, 2026 09:053,41536,416,04427,343,0001,007,0002,113,536
6Jul 10, 2026 09:053,45737,068,27927,654,0001,042,0002,113,536
7Jul 10, 2026 09:053,48536,873,92927,919,0001,007,0002,113,536
8Jul 10, 2026 09:053,51837,746,32328,191,0001,016,0002,113,536
9Jul 10, 2026 09:053,55637,865,35328,504,0001,013,0002,113,536