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 5, 2026 01:14olliecrowolliecrowScore: 69,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 01:1469,37050,237,80124,641,0001,026,0002,281,472
2Mar 5, 2026 01:1469,85454,422,61324,852,000994,0002,281,472
3Mar 5, 2026 01:1469,87350,814,35824,859,000994,0002,281,472