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 listNov 12, 2025 12:22Aliaksandr MikheiAliaksandr MikheiScore: 74,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 12:2274,492642,857,610548,252,00070,032,0002,285,568
2Nov 12, 2025 12:2274,493643,895,256562,360,00055,936,0002,289,664
3Nov 12, 2025 12:2274,506648,138,875542,352,00076,049,0002,285,568
4Nov 12, 2025 12:2274,536647,203,054569,679,00048,972,0002,260,992
5Nov 12, 2025 12:2274,554645,856,698554,822,00063,979,0002,510,848
6Nov 12, 2025 12:2274,582641,941,355545,030,00074,004,0002,277,376
7Nov 12, 2025 12:2274,587646,596,662567,067,00052,006,0002,277,376
8Nov 12, 2025 12:2274,625649,488,529556,346,00063,039,0002,502,656
9Nov 12, 2025 12:2274,719643,749,090555,148,00065,017,0002,285,568