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 21, 2026 14:49Charles CabergsCharles CabergsError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 14:49045,547,59424,201,0002,016,0002,424,832expected "429496481084 ", got "429496481085 "stderr
2Apr 21, 2026 14:49046,013,24224,163,0002,013,0002,355,200expected "429496480862 ", got "429496480863 "stderr
3Apr 21, 2026 14:49039,841,38525,229,0001,009,0002,416,640expected "429496563919 ", got "429496563920 "stderr