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 02:50Josu San MartinJosu San MartinScore: 69,792Success
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 02:5069,10046,794,78625,567,00002,396,160
2Jan 13, 2026 02:5069,79252,952,62424,830,000993,0002,396,160
3Jan 13, 2026 02:5069,87856,364,88623,867,0001,988,0002,277,376