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:02Chandrasekaran AkashChandrasekaran AkashScore: 7,990,919Success
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:027,817,9972,918,066,8942,891,660,000999,0002,269,184
2Apr 11, 2025 01:027,990,9192,979,371,5662,954,642,0001,998,0002,269,184
3Apr 11, 2025 01:028,103,6033,026,070,4922,997,334,000999,0002,269,184