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:08Franek KortaFranek KortaScore: 105,449Success
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:08103,315102,741,03938,226,52402,211,840
2Aug 27, 2023 20:08105,449117,903,24939,015,96102,289,664
3Aug 27, 2023 20:08108,178114,680,15040,025,84302,281,472