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 10, 2025 14:08izotoffizotoffScore: 185,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 14:08185,15198,246,41767,499,0001,007,0002,441,216
2Nov 10, 2025 14:08185,62295,436,34465,650,0003,030,0002,322,432
3Nov 10, 2025 14:08185,97893,222,34666,818,0001,994,0002,322,432