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 13, 2026 02:53Kevin HeaveyKevin HeaveyScore: 3,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 02:543,81641,264,22730,660,0001,021,0002,117,632
2Jul 13, 2026 02:543,81941,346,74630,676,0001,022,0002,117,632
3Jul 13, 2026 02:543,82041,313,10130,497,0001,217,0002,117,632
4Jul 13, 2026 02:543,85641,634,89030,802,0001,204,0002,117,632
5Jul 13, 2026 02:543,86341,675,78130,853,0001,218,0002,117,632
6Jul 13, 2026 02:543,87241,803,52831,110,0001,035,0002,117,632
7Jul 13, 2026 02:543,87241,745,54931,109,0001,036,0002,117,632
8Jul 13, 2026 02:543,87741,916,32831,143,0001,040,0002,117,632
9Jul 13, 2026 02:543,88241,772,82331,180,0001,041,0002,117,632