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 23:14Steve BronderSteve BronderScore: 65,078Success
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 23:1464,94641,727,72723,029,0001,001,0002,277,376
2Jul 15, 2025 23:1465,07847,393,70022,073,0002,006,0002,539,520
3Jul 15, 2025 23:1465,30050,598,09223,155,0001,006,0002,424,832