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 16, 2026 16:15olliecrowolliecrowScore: 546,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 16:15537,373221,248,04821,981,000176,847,0002,473,984
2Apr 16, 2026 16:15546,262224,409,82523,013,000179,104,0002,404,352
3Apr 16, 2026 16:15559,138237,570,94322,986,000183,895,0002,273,280