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:39Steve BronderSteve BronderScore: 65,670Success
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:3965,48952,320,65724,231,00002,539,520
2Jul 15, 2025 04:3965,67045,215,04123,286,0001,012,0002,539,520
3Jul 15, 2025 04:3965,68650,417,09423,292,0001,012,0002,277,376