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 listMar 17, 2025 23:34Aniruddha DebAniruddha DebScore: 69,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:3469,89251,432,56623,871,0001,989,0002,428,928
2Mar 17, 2025 23:3469,92751,068,97024,878,000995,0002,510,848
3Mar 17, 2025 23:3470,92242,746,16025,232,0001,009,0002,531,328