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 listJun 29, 2026 19:49IlyaIlyaScore: 59,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 19:5059,59431,579,98520,918,0001,132,0002,113,536
2Jun 29, 2026 19:5059,72431,569,10020,980,0001,118,0002,117,632
3Jun 29, 2026 19:5059,74831,503,84820,908,0001,199,0002,113,536
4Jun 29, 2026 19:5059,75431,485,76120,938,0001,171,0002,113,536
5Jun 29, 2026 19:5059,75931,542,40121,006,0001,105,0002,113,536
6Jun 29, 2026 19:5059,80832,071,68620,927,0001,202,0002,113,536
7Jun 29, 2026 19:5059,89431,653,76820,975,0001,186,0002,113,536
8Jun 29, 2026 19:5060,12432,130,97321,042,0001,204,0002,113,536
9Jun 29, 2026 19:5060,12732,196,53221,039,0001,208,0002,113,536