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 11:41Aliaksandr MikheiAliaksandr MikheiScore: 102,558Success
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 11:41102,403878,261,926763,952,00085,994,0002,519,040
2Nov 12, 2025 11:41102,414875,996,426786,034,00064,002,0002,285,568
3Nov 12, 2025 11:41102,490879,111,628772,695,00077,969,0002,285,568
4Nov 12, 2025 11:41102,518874,154,809775,910,00074,991,0002,285,568
5Nov 12, 2025 11:41102,558882,370,678780,215,00071,019,0002,285,568
6Nov 12, 2025 11:41102,565882,164,239782,268,00069,023,0002,269,184
7Nov 12, 2025 11:41102,568877,482,308767,383,00083,932,0002,285,568
8Nov 12, 2025 11:41102,584875,950,647786,488,00064,957,0002,285,568
9Nov 12, 2025 11:41102,602875,271,599787,624,00063,969,0002,265,088