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: 942,484Success
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:49937,095373,694,988344,727,0001,998,0002,531,328
2Jan 12, 2026 04:49942,484373,331,611347,720,000999,0002,527,232
3Jan 12, 2026 04:49947,024371,271,845350,399,00002,531,328