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 17, 2024 14:38IhebIhebScore: 22,217,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2024 14:3822,197,2168,278,308,8538,212,969,93202,277,376
2Aug 17, 2024 14:3822,217,6778,281,124,3758,220,540,38102,281,472
3Aug 17, 2024 14:3822,222,9018,294,476,2898,222,473,40402,285,568