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 listSep 27, 2026 17:31illliliiill1116illliliiill1116Score: 8,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 17:318,48180,608,21869,260,0001,133,0002,113,536
2Sep 27, 2026 17:318,48780,667,74269,321,0001,124,0002,113,536
3Sep 27, 2026 17:318,48880,823,49469,443,0001,012,0002,113,536
4Sep 27, 2026 17:318,50280,917,70269,361,0001,208,0002,113,536
5Sep 27, 2026 17:318,50380,931,33769,401,0001,174,0002,113,536
6Sep 27, 2026 17:318,50480,824,65069,378,0001,212,0002,113,536
7Sep 27, 2026 17:318,50480,858,45769,432,0001,152,0002,113,536
8Sep 27, 2026 17:318,51180,890,54769,444,0001,204,0002,113,536
9Sep 27, 2026 17:318,57681,513,90169,988,0001,194,0002,113,536