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 21, 2026 22:32Kevin HeaveyKevin HeaveyScore: 4,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 22:403,95843,263,56031,816,0001,042,0002,113,536
2Jul 21, 2026 22:403,97042,806,45531,914,0001,044,0002,113,536
3Jul 21, 2026 22:403,97442,777,92631,746,0001,242,0002,113,536
4Jul 21, 2026 22:403,99342,975,12232,104,0001,040,0002,113,536
5Jul 21, 2026 22:404,00046,234,48832,161,0001,041,0002,113,536
6Jul 21, 2026 22:404,00043,170,39832,166,0001,042,0002,113,536
7Jul 21, 2026 22:404,14947,511,02033,399,0001,041,0002,113,536
8Jul 21, 2026 22:404,15344,363,68033,433,0001,040,0002,113,536
9Jul 21, 2026 22:404,27645,393,23634,459,0001,040,0002,113,536