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 10, 2025 12:36Aliaksandr MikheiAliaksandr MikheiScore: 2,067,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 12:362,061,55817,147,515,51517,048,967,00061,967,0002,277,376
2Nov 10, 2025 12:362,065,76717,184,217,00817,088,898,00056,972,0002,289,664
3Nov 10, 2025 12:362,066,22917,189,651,32717,078,735,00070,965,0002,285,568
4Nov 10, 2025 12:362,066,92417,192,104,78717,087,505,00067,966,0002,277,376
5Nov 10, 2025 12:362,067,03417,186,665,44117,068,420,00087,960,0002,277,376
6Nov 10, 2025 12:362,068,05617,195,481,99617,092,903,00071,965,0002,289,664
7Nov 10, 2025 12:362,069,86617,213,391,61317,126,919,00052,971,0002,519,040
8Nov 10, 2025 12:362,074,93317,253,457,97617,156,972,00064,969,0002,277,376
9Nov 10, 2025 12:362,074,94917,257,596,04517,148,108,00073,965,0002,277,376