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 14:44izotoffizotoffScore: 120,532Success
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 14:44119,54970,932,37843,228,0001,005,0002,326,528
2Nov 10, 2025 14:44120,09773,004,41442,417,0002,019,0002,433,024
3Nov 10, 2025 14:44120,28668,904,94443,495,0001,011,0002,322,432
4Nov 10, 2025 14:44120,42468,275,84042,485,0002,072,0002,322,432
5Nov 10, 2025 14:44120,53272,521,19843,584,0001,013,0002,424,832
6Nov 10, 2025 14:44120,67870,840,38844,651,00002,322,432
7Nov 10, 2025 14:44120,80573,313,53944,698,00002,326,528
8Nov 10, 2025 14:44121,27672,140,64343,875,000997,0002,322,432
9Nov 10, 2025 14:44121,68674,765,24243,023,0002,001,0002,322,432