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 listNov 10, 2025 18:54izotoffizotoffScore: 128,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 18:54128,13867,822,07147,411,00002,531,328
2Nov 10, 2025 18:54128,26274,029,27245,438,0002,019,0002,301,952
3Nov 10, 2025 18:54129,32777,852,36344,861,0002,990,0002,301,952