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 listMar 16, 2025 14:47CemaCemaScore: 170,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2025 14:47170,90384,860,86161,227,0002,007,0002,265,088
2Mar 16, 2025 14:47170,90883,690,21261,229,0002,007,0002,285,568
3Mar 16, 2025 14:47176,96294,404,12665,476,00002,289,664