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:25olliecrowolliecrowScore: 78,335Success
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:2578,28651,964,25027,968,000998,0002,293,760
2Apr 16, 2026 16:2578,33559,311,49125,986,0002,998,0002,338,816
3Apr 16, 2026 16:2580,13549,056,47628,662,000988,0002,322,432