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 5, 2026 13:08Teow Hua JunTeow Hua JunScore: 15,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:1015,290136,270,993125,880,0001,035,0002,117,632
2Jul 5, 2026 13:1015,308136,357,924126,042,0001,020,0002,117,632
3Jul 5, 2026 13:1015,333136,716,866126,210,0001,061,0002,117,632
4Jul 5, 2026 13:1015,366138,885,928126,500,0001,042,0002,117,632
5Jul 5, 2026 13:1015,380137,067,909126,613,0001,048,0002,117,632
6Jul 5, 2026 13:1015,796140,485,583130,085,0001,027,0002,117,632
7Jul 5, 2026 13:1015,821140,707,506130,309,0001,007,0002,117,632
8Jul 5, 2026 13:1015,850140,948,847130,533,0001,023,0002,117,632
9Jul 5, 2026 13:1015,876141,263,370130,746,0001,030,0002,117,632