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 13:58kauruuskauruusScore: 58,754Success
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 13:5858,603513,923,665485,403,0001,000,0002,371,584
2Nov 5, 2024 13:5858,621512,801,551484,555,0001,998,0002,293,760
3Nov 5, 2024 13:5858,634511,998,963485,661,000999,0002,375,680
4Nov 5, 2024 13:5858,693515,517,171485,150,0002,000,0002,375,680
5Nov 5, 2024 13:5858,754515,145,094486,663,000999,0002,289,664
6Nov 5, 2024 13:5858,759518,060,447485,705,0001,998,0002,371,584
7Nov 5, 2024 13:5858,847521,321,042488,434,00002,285,568
8Nov 5, 2024 13:5858,862527,670,289486,557,0001,998,0002,293,760
9Nov 5, 2024 13:5858,931510,253,932488,128,0001,000,0002,473,984