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 17, 2026 16:06Kevin HeaveyKevin HeaveyScore: 3,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 16:093,68240,327,97929,511,0001,056,0002,117,632
2Jul 17, 2026 16:093,75640,968,58230,138,0001,045,0002,117,632
3Jul 17, 2026 16:093,77541,097,36130,293,0001,044,0002,117,632
4Jul 17, 2026 16:093,82341,496,73630,691,0001,041,0002,117,632
5Jul 17, 2026 16:093,86441,858,71030,834,0001,243,0002,117,632
6Jul 17, 2026 16:093,90342,163,64631,353,0001,044,0002,117,632
7Jul 17, 2026 16:093,90742,296,62431,395,0001,041,0002,117,632
8Jul 17, 2026 16:093,91542,331,35931,450,0001,045,0002,117,632
9Jul 17, 2026 16:093,95342,614,78831,567,0001,245,0002,117,632