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 listJul 8, 2021 22:21Yurkov AlekseyYurkov AlekseyScore: 172,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 22:21171,756119,569,96363,549,74702,269,184
2Jul 8, 2021 22:21172,311129,173,00463,755,03902,265,088
3Jul 8, 2021 22:21173,459131,372,21964,179,90702,256,896