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 listMay 4, 2026 21:34olliecrowolliecrowScore: 138,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:36137,37057,220,68449,783,0001,044,0002,461,696stderr
2May 4, 2026 21:36137,94858,794,98349,994,0001,047,0002,453,504stderr
3May 4, 2026 21:36138,15957,558,60149,962,0001,157,0002,453,504stderr
4May 4, 2026 21:36138,21357,524,82549,973,0001,166,0002,453,504stderr
5May 4, 2026 21:36138,37558,243,87150,045,0001,154,0002,457,600stderr
6May 4, 2026 21:36138,53257,545,25950,118,0001,139,0002,449,408stderr
7May 4, 2026 21:36138,61857,600,33850,130,0001,159,0002,461,696stderr
8May 4, 2026 21:36139,19458,458,98150,362,0001,140,0002,461,696stderr
9May 4, 2026 21:36139,34557,560,22350,407,0001,151,0002,461,696stderr