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 12, 2026 04:49Josu San MartinJosu San MartinScore: 71,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:4970,83548,398,05224,193,0002,016,0002,359,296
2Jan 12, 2026 04:4971,03049,214,69025,271,0001,010,0002,359,296
3Jan 12, 2026 04:4971,31149,783,95725,371,0001,014,0002,371,584