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:40Josu San MartinJosu San MartinScore: 69,246Success
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:4068,95449,075,10824,493,0001,020,0002,347,008
2Jan 13, 2026 00:4069,24651,107,76825,621,00002,281,472
3Jan 13, 2026 00:4069,85756,260,82124,853,000994,0002,281,472