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 21, 2025 05:30Steve BronderSteve BronderScore: 72,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 05:3072,84950,375,69825,956,000998,0002,527,232
2Apr 21, 2025 05:3072,96548,263,75424,998,0001,999,0002,531,328
3Apr 21, 2025 05:3073,31950,108,58125,119,0002,009,0002,428,928