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:05Steve BronderSteve BronderScore: 61,811Success
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:0561,77647,428,44720,870,0001,987,0002,539,520
2Jul 15, 2025 04:0561,79247,656,35722,863,00002,441,216
3Jul 15, 2025 04:0561,79542,677,82821,870,000994,0002,428,928
4Jul 15, 2025 04:0561,80841,373,38421,875,000994,0002,437,120
5Jul 15, 2025 04:0561,81145,366,72222,870,00002,428,928
6Jul 15, 2025 04:0561,84144,640,10920,892,0001,989,0002,441,216
7Jul 15, 2025 04:0561,86844,185,65521,851,0001,040,0002,539,520
8Jul 15, 2025 04:0561,92246,235,83621,915,000996,0002,433,024
9Jul 15, 2025 04:0562,07352,386,57120,970,0001,997,0002,433,024