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 08:48mebowlermebowlerScore: 301,257Success
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 08:48298,659136,696,21063,869,00046,635,0002,502,656
2Jan 28, 2025 08:48301,257137,084,31363,264,00048,201,0002,527,232
3Jan 28, 2025 08:48303,581138,160,80162,180,00050,145,0002,285,568