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 22:16Steve BronderSteve BronderScore: 65,465Success
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 22:1665,14144,062,05122,094,0002,008,0002,277,376
2Jul 15, 2025 22:1665,46544,614,28422,204,0002,018,0002,420,736
3Jul 15, 2025 22:1665,53844,429,54723,239,0001,010,0002,519,040