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 listNov 7, 2025 17:18Daniel MastalerzDaniel MastalerzScore: 190,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2025 17:18190,44690,024,19770,465,00002,519,040
2Nov 7, 2025 17:18190,67696,494,20569,543,0001,007,0002,404,352
3Nov 7, 2025 17:18191,043101,169,40869,677,0001,009,0002,396,160