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 5, 2024 21:20Manuel PepeManuel PepeScore: 212,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 21:20212,2201,783,034,5341,663,460,00097,968,0002,498,560
2Nov 5, 2024 21:20212,2811,786,705,2341,673,990,00087,946,0002,486,272
3Nov 5, 2024 21:20212,3351,785,065,6521,658,419,000103,963,0002,326,528
4Nov 5, 2024 21:20212,4181,794,371,5461,671,119,00091,951,0002,306,048
5Nov 5, 2024 21:20212,4651,790,381,6601,677,484,00085,973,0002,486,272
6Nov 5, 2024 21:20212,5481,794,991,9381,666,199,00097,952,0002,494,464
7Nov 5, 2024 21:20212,5641,789,455,4341,651,329,000112,954,0002,326,528
8Nov 5, 2024 21:20212,6261,790,050,6471,660,870,000103,929,0002,318,336
9Nov 5, 2024 21:20212,6321,791,218,5891,675,856,00088,992,0002,326,528