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 listApr 18, 2025 03:37Chandrasekaran AkashChandrasekaran AkashScore: 60,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 03:3760,82448,686,40022,505,00002,506,752
2Apr 18, 2025 03:3760,88446,945,63122,527,00002,510,848
3Apr 18, 2025 03:3761,04952,042,62122,588,00002,506,752