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 listDec 8, 2025 23:01pseppsepScore: 334,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 23:01334,2892,799,164,1322,701,637,00072,963,0002,285,568
2Dec 8, 2025 23:01334,3362,802,126,3662,721,005,00053,980,0002,277,376
3Dec 8, 2025 23:01334,3662,797,788,1122,708,282,00066,957,0002,277,376
4Dec 8, 2025 23:01334,3912,797,703,2822,703,490,00071,959,0002,277,376
5Dec 8, 2025 23:01334,4132,800,282,9702,708,659,00066,966,0002,285,568
6Dec 8, 2025 23:01334,4652,801,005,3282,711,082,00064,978,0002,277,376
7Dec 8, 2025 23:01334,5382,800,625,0422,729,692,00046,977,0002,277,376
8Dec 8, 2025 23:01335,0772,808,344,0162,709,185,00071,951,0002,277,376
9Dec 8, 2025 23:01337,8232,833,684,1132,740,956,00062,976,0002,277,376