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 4, 2026 03:35olliecrowolliecrowScore: 173,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:35167,78684,243,94660,079,0002,002,0002,285,568
2Mar 4, 2026 03:35173,25187,198,94062,100,0002,003,0002,277,376
3Mar 4, 2026 03:35174,06289,517,26264,403,00002,400,256