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 19, 2026 06:54olliecrowolliecrowScore: 75,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 06:5475,33554,374,52826,879,000995,0002,297,856
2Apr 19, 2026 06:5475,40358,543,99226,903,000996,0002,297,856
3Apr 19, 2026 06:5475,43856,942,91625,919,0001,993,0002,527,232