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 09:52Kevin HeaveyKevin HeaveyScore: 3,860Success
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 09:543,78841,221,62730,415,0001,030,0002,113,536
2Jul 21, 2026 09:543,83742,318,90330,796,0001,052,0002,113,536
3Jul 21, 2026 09:543,85041,939,98630,907,0001,056,0002,113,536
4Jul 21, 2026 09:543,85942,577,43630,998,0001,034,0002,113,536
5Jul 21, 2026 09:543,86044,885,30631,001,0001,042,0002,113,536
6Jul 21, 2026 09:543,86442,632,60631,033,0001,044,0002,113,536
7Jul 21, 2026 09:543,88542,732,67431,204,0001,043,0002,113,536
8Jul 21, 2026 09:543,89442,823,22831,271,0001,054,0002,113,536
9Jul 21, 2026 09:543,90242,873,07431,349,0001,044,0002,113,536