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 19, 2025 07:27Ian MckibbenIan MckibbenScore: 107,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:27107,07664,489,44939,618,00002,424,832
2Jan 19, 2025 07:27107,82265,179,22138,897,000997,0002,424,832
3Jan 19, 2025 07:27107,89563,966,23838,923,000998,0002,437,120