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 listJul 15, 2025 04:15Steve BronderSteve BronderScore: 61,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 04:1561,76848,409,07821,861,000993,0002,510,848
2Jul 15, 2025 04:1561,77647,671,58620,870,0001,987,0002,433,024
3Jul 15, 2025 04:1561,81951,612,66121,879,000994,0002,428,928