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 22, 2025 01:13Ian MckibbenIan MckibbenScore: 71,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:1371,28449,294,45125,361,0001,014,0002,433,024
2Jan 22, 2025 01:1371,40548,298,64725,404,0001,016,0002,437,120
3Jan 22, 2025 01:1372,07658,444,62726,668,00002,531,328