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 03:16Josu San MartinJosu San MartinScore: 69,503Success
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 03:1669,34355,234,03525,657,00002,277,376
2Jan 13, 2026 03:1669,50362,797,99124,688,0001,028,0002,277,376
3Jan 13, 2026 03:1669,83251,273,93624,845,000993,0002,277,376