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 04:42Charles CabergsCharles CabergsScore: 72,657Success
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 04:4271,98952,841,80526,636,00002,383,872
2Apr 19, 2026 04:4272,65750,884,59525,888,000995,0002,375,680
3Apr 19, 2026 04:4272,73054,841,88424,917,0001,993,0002,510,848