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 listOct 2, 2026 11:54Karthik ReddyKarthik ReddyScore: 3,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 11:553,2743,036,342,79527,179,000020,480
2Oct 2, 2026 11:553,2753,036,312,87327,183,000020,480
3Oct 2, 2026 11:553,2763,036,254,07327,194,000020,480
4Oct 2, 2026 11:553,2823,036,336,99427,241,000020,480
5Oct 2, 2026 11:553,2833,036,332,33727,253,000020,480
6Oct 2, 2026 11:553,2853,036,378,59227,269,000020,480
7Oct 2, 2026 11:553,2883,036,398,46127,297,000020,480
8Oct 2, 2026 11:553,2903,036,269,57027,313,000020,480
9Oct 2, 2026 11:553,2923,036,475,50626,241,0001,086,00020,480