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 listMar 26, 2026 22:15Dominique GarmierDominique GarmierScore: 682,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 22:15650,532265,312,406239,699,000998,0002,363,392
2Mar 26, 2026 22:15682,297281,283,933251,449,0001,001,0002,351,104
3Mar 26, 2026 22:15683,638276,619,941251,947,000999,0002,355,200