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 11, 2025 01:46Chandrasekaran AkashChandrasekaran AkashScore: 71,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 01:4671,60847,342,10026,495,00002,453,504
2Apr 11, 2025 01:4671,68451,273,42626,523,00002,441,216
3Apr 11, 2025 01:4672,11459,753,12226,682,00002,531,328