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:39Chandrasekaran AkashChandrasekaran AkashScore: 61,024Success
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:3960,99745,316,21321,544,0001,025,0002,277,376
2Apr 18, 2025 03:3961,02448,676,94022,579,00002,506,752
3Apr 18, 2025 03:3961,35950,879,26122,703,00002,277,376