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:02Steve BronderSteve BronderScore: 63,116Success
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:0263,02446,475,34323,319,00002,437,120
2Jul 15, 2025 04:0263,11651,108,35023,353,00002,539,520
3Jul 15, 2025 04:0263,55945,633,88923,517,00002,433,024