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 29, 2026 06:52Karthik ReddyKarthik ReddyScore: 8,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 06:538,25478,824,95967,356,0001,158,0002,113,536
2Sep 29, 2026 06:538,29579,133,77067,756,0001,096,0002,113,536
3Sep 29, 2026 06:538,31579,403,52167,858,0001,163,0002,113,536
4Sep 29, 2026 06:538,33979,499,40468,065,0001,153,0002,113,536
5Sep 29, 2026 06:538,36979,803,93468,304,0001,163,0002,113,536
6Sep 29, 2026 06:538,37779,872,88068,371,0001,163,0002,113,536
7Sep 29, 2026 06:538,39180,167,21168,486,0001,165,0002,113,536
8Sep 29, 2026 06:538,39379,966,68968,519,0001,150,0002,113,536
9Sep 29, 2026 06:538,40980,123,24568,656,0001,144,0002,113,536