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 8, 2025 08:00AnSaAnSaScore: 72,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 08:0072,80049,502,42224,941,0001,995,0002,531,328
2Nov 8, 2025 08:0072,84955,972,20324,958,0001,996,0002,502,656
3Nov 8, 2025 08:0073,20349,665,25125,079,0002,006,0002,265,088