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 listApr 22, 2025 21:00Steve BronderSteve BronderScore: 68,497Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 21:0068,40845,919,66325,311,00002,277,376
2Apr 22, 2025 21:0068,49744,832,66425,344,00002,539,520
3Apr 22, 2025 21:0068,57645,253,13324,359,0001,014,0002,437,120