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 16, 2026 22:16izotoffizotoffScore: 137,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:16137,47377,283,62446,876,0003,989,0002,396,160
2Mar 16, 2026 22:16137,56577,148,64648,903,0001,996,0002,396,160
3Mar 16, 2026 22:16138,32781,564,57748,171,0003,010,0002,387,968