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 20, 2026 18:08olliecrowolliecrowScore: 101,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 18:08101,59564,631,39036,575,0001,015,0002,342,912
2Mar 20, 2026 18:08101,68463,044,18335,590,0002,033,0002,334,720
3Mar 20, 2026 18:08102,30862,730,39036,858,000996,0002,437,120