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 1, 2022 22:17Franek KortaFranek KortaScore: 130,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2022 22:17129,772110,292,26348,015,51602,273,280
2Aug 1, 2022 22:17130,052119,035,39548,119,42202,269,184
3Aug 1, 2022 22:17130,430107,523,28148,259,25102,269,184