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 19:54KeefeKeefeScore: 78,427Success
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 19:5478,40054,422,13627,008,0002,000,0002,400,256
2Apr 18, 2025 19:5478,42755,620,00927,017,0002,001,0002,273,280
3Apr 18, 2025 19:5478,69251,755,56527,108,0002,008,0002,400,256