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 02:58olliecrowolliecrowScore: 218,789Success
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 02:58218,389104,613,77834,915,00045,889,0002,371,584
2Apr 19, 2026 02:58218,789106,008,28741,975,00038,977,0002,277,376
3Apr 19, 2026 02:58218,892106,258,86632,996,00047,994,0002,371,584