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 13, 2026 17:18olliecrowolliecrowScore: 60,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 17:1859,76845,117,45720,104,0002,010,0002,400,256
2Mar 13, 2026 17:1860,50350,705,81321,369,0001,017,0002,273,280
3Mar 13, 2026 17:1860,53845,930,22822,399,00002,400,256