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 24, 2026 12:44wnwnScore: 3,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 12:453,33036,338,64326,636,0001,011,0002,113,536
2Sep 24, 2026 12:453,36436,491,78126,906,0001,016,0002,113,536
3Sep 24, 2026 12:453,41937,308,77627,338,0001,041,0002,113,536
4Sep 24, 2026 12:453,47738,313,61327,857,0001,009,0002,113,536
5Sep 24, 2026 12:453,49037,655,51827,972,0001,003,0002,113,536
6Sep 24, 2026 12:453,49337,659,23927,966,0001,031,0002,113,536
7Sep 24, 2026 12:453,51138,593,72628,131,0001,013,0002,113,536
8Sep 24, 2026 12:453,51237,718,39328,137,0001,020,0002,113,536
9Sep 24, 2026 12:453,51338,679,71128,132,0001,033,0002,113,536