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 listJul 20, 2026 21:17allllekssssaallllekssssaScore: 220,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:18220,1401,837,008,7501,762,079,00065,087,0002,113,536
2Jul 20, 2026 21:18220,2321,837,965,5071,761,821,00066,106,0002,113,536
3Jul 20, 2026 21:18220,2721,838,194,7301,763,180,00065,080,0002,113,536
4Jul 20, 2026 21:18220,2811,838,154,0751,762,250,00066,087,0002,113,536
5Jul 20, 2026 21:18220,2841,838,253,2911,762,287,00066,077,0002,113,536
6Jul 20, 2026 21:18220,3601,838,830,1371,762,894,00066,096,0002,113,536
7Jul 20, 2026 21:18226,7371,891,997,0931,816,843,00065,080,0002,113,536
8Jul 20, 2026 21:18246,3292,055,267,9081,979,458,00065,077,0002,113,536
9Jul 20, 2026 21:18246,5492,056,260,0411,979,302,00067,061,0002,113,536