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 26, 2026 07:20Charles CabergsCharles CabergsScore: 70,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 07:2070,64343,836,28124,128,0002,010,0002,359,296
2Apr 26, 2026 07:2070,66442,407,03324,135,0002,011,0002,359,296
3Apr 26, 2026 07:2070,67845,949,73124,140,0002,011,0002,359,296
4Apr 26, 2026 07:2070,87842,761,93424,208,0002,017,0002,449,408
5Apr 26, 2026 07:2070,90543,045,10925,226,0001,009,0002,359,296
6Apr 26, 2026 07:2070,97245,783,22324,240,0002,020,0002,306,048
7Apr 26, 2026 07:2070,99139,915,85825,257,0001,010,0002,310,144
8Apr 26, 2026 07:2070,99447,622,32024,248,0002,020,0002,355,200
9Apr 26, 2026 07:2071,06248,685,14324,271,0002,022,0002,359,296