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 15, 2026 19:47Elijah KinElijah KinScore: 214,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:47214,046104,817,33031,077,00048,120,0002,273,280
2Mar 15, 2026 19:47214,157100,870,68934,102,00045,136,0002,310,144
3Mar 15, 2026 19:47215,662107,965,31240,895,00038,900,0002,273,280