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 listAug 2, 2026 08:36TonyTonyScore: 28,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 08:3728,523245,283,700235,640,0001,108,0002,117,632
2Aug 2, 2026 08:3728,524245,157,010235,625,0001,129,0002,117,632
3Aug 2, 2026 08:3728,535245,043,765235,728,0001,113,0002,117,632
4Aug 2, 2026 08:3728,540245,352,284235,653,0001,236,0002,117,632
5Aug 2, 2026 08:3728,545245,542,878235,811,0001,114,0002,117,632
6Aug 2, 2026 08:3728,547245,212,853235,846,0001,102,0002,117,632
7Aug 2, 2026 08:3728,556245,493,861235,901,0001,116,0002,117,632
8Aug 2, 2026 08:3728,721246,636,077237,249,0001,141,0002,117,632
9Aug 2, 2026 08:3728,729246,797,294237,260,0001,198,0002,117,632