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:49Josu San MartinJosu San MartinScore: 69,297Success
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:4969,02751,860,57424,519,0001,021,0002,273,280
2Jan 17, 2026 01:4969,29759,807,84725,640,00002,265,088
3Jan 17, 2026 01:4969,44161,556,92525,693,00002,260,992