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 19, 2025 01:22KeefeKeefeScore: 690,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 01:22690,684283,006,292254,551,0001,002,0002,289,664
2Apr 19, 2025 01:22690,703286,530,303254,558,0001,002,0002,371,584
3Apr 19, 2025 01:22696,238283,933,146254,613,0002,995,0002,289,664