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 00:27Josu San MartinJosu San MartinScore: 69,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 00:2769,82452,492,58924,842,000993,0002,281,472
2Jan 13, 2026 00:2769,88454,644,90624,863,000994,0002,351,104
3Jan 13, 2026 00:2770,12257,961,11623,950,0001,995,0002,355,200