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 14:47IlyaIlyaScore: 60,578Success
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 14:5060,24331,826,51221,081,0001,209,0002,113,536
2Jun 29, 2026 14:5060,25431,794,11821,114,0001,180,0002,113,536
3Jun 29, 2026 14:5060,28932,225,47021,097,0001,210,0002,113,536
4Jun 29, 2026 14:5060,53732,325,33821,200,0001,199,0002,113,536
5Jun 29, 2026 14:5060,57834,014,74321,195,0001,219,0002,113,536
6Jun 29, 2026 14:5060,58931,981,84921,207,0001,211,0002,113,536
7Jun 29, 2026 14:5060,64532,406,84821,235,0001,204,0002,117,632
8Jun 29, 2026 14:5060,66732,424,85421,239,0001,208,0002,113,536
9Jun 29, 2026 14:5061,32132,692,99021,456,0001,233,0002,113,536