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 listJan 13, 2026 01:01Josu San MartinJosu San MartinScore: 68,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:0168,68449,962,56624,397,0001,016,0002,347,008
2Jan 13, 2026 01:0168,88447,312,26725,487,00002,453,504
3Jan 13, 2026 01:0169,15756,218,35924,565,0001,023,0002,347,008