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 listMar 29, 2026 13:56Danylo MocherniukDanylo MocherniukScore: 12,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:5612,407124,309,190101,975,000999,0002,293,760
2Mar 29, 2026 13:5612,408124,280,023101,986,000999,0002,506,752
3Mar 29, 2026 13:5612,409131,841,426101,996,000999,0002,293,760
4Mar 29, 2026 13:5612,424126,273,784101,119,0002,002,0002,502,656
5Mar 29, 2026 13:5612,431127,080,821101,174,0002,003,0002,293,760
6Mar 29, 2026 13:5612,527127,937,778101,972,0001,999,0002,506,752
7Mar 29, 2026 13:5612,541125,040,283103,088,0001,000,0002,293,760
8Mar 29, 2026 13:5612,546130,396,924102,127,0002,002,0002,502,656
9Mar 29, 2026 13:5612,626129,408,046102,803,0001,996,0002,293,760