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 15, 2026 12:39olliecrowolliecrowScore: 61,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 12:3961,08453,970,45321,574,0001,027,0002,293,760
2Apr 15, 2026 12:3961,13246,282,94522,619,00002,449,408
3Apr 15, 2026 12:3961,75148,754,91620,862,0001,986,0002,293,760