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 17, 2026 01:48Josu San MartinJosu San MartinScore: 69,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 01:4869,34155,027,44325,656,00002,273,280
2Jan 17, 2026 01:4869,85750,518,70124,853,000994,0002,277,376
3Jan 17, 2026 01:4870,55149,232,50424,096,0002,008,0002,269,184