TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listAug 27, 2023 20:04Franek KortaFranek KortaScore: 102,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 20:04101,37662,480,14035,482,0002,027,0002,437,120
2Aug 27, 2023 20:04101,72262,060,94337,637,00002,441,216
3Aug 27, 2023 20:04101,82461,695,80437,675,00002,269,184
4Aug 27, 2023 20:04101,83061,206,34237,677,00002,531,328
5Aug 27, 2023 20:04102,32762,860,53736,865,000996,0002,437,120
6Aug 27, 2023 20:04102,32764,676,60236,865,000996,0002,437,120
7Aug 27, 2023 20:04102,55160,207,21535,947,0001,997,0002,269,184
8Aug 27, 2023 20:04102,69260,725,25935,997,0001,999,0002,527,232
9Aug 27, 2023 20:04103,09756,926,70136,139,0002,007,0002,437,120
10Aug 27, 2023 20:04108,622116,909,32640,190,00702,297,856
11Aug 27, 2023 20:04109,029108,662,32940,340,83402,199,552
12Aug 27, 2023 20:04109,12895,508,60640,377,26702,281,472