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 13, 2025 23:38Cyril SharmaCyril SharmaScore: 39,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 23:3839,069346,460,822275,234,00049,041,0002,289,664
2Jul 13, 2025 23:3839,070345,048,352274,237,00050,043,0002,285,568
3Jul 13, 2025 23:3839,084344,719,853264,323,00060,073,0002,285,568
4Jul 13, 2025 23:3839,095352,276,523269,406,00055,083,0002,285,568
5Jul 13, 2025 23:3839,104353,556,300275,481,00049,085,0002,285,568
6Jul 13, 2025 23:3839,120350,898,406271,748,00052,950,0002,473,984
7Jul 13, 2025 23:3839,121348,067,879262,761,00061,943,0002,269,184
8Jul 13, 2025 23:3839,140350,582,534274,884,00049,979,0002,285,568
9Jul 13, 2025 23:3839,270349,952,484276,952,00048,991,0002,285,568