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 listJan 28, 2025 09:32mebowlermebowlerScore: 2,354,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:322,301,795881,692,252778,693,00072,971,0002,297,856
2Jan 28, 2025 09:322,354,976899,529,785802,394,00068,947,0002,289,664
3Jan 28, 2025 09:322,417,746915,638,964816,604,00077,962,0002,281,472