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 22, 2026 19:10Charles CabergsCharles CabergsScore: 70,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 19:1170,55446,589,03724,097,0002,008,0002,306,048
2Apr 22, 2026 19:1170,65645,878,07524,132,0002,011,0002,351,104
3Apr 22, 2026 19:1170,73242,588,66924,158,0002,013,0002,359,296
4Apr 22, 2026 19:1170,87044,315,69525,214,0001,008,0002,306,048
5Apr 22, 2026 19:1170,88148,863,10924,284,0001,942,0002,306,048
6Apr 22, 2026 19:1170,89743,675,93625,224,0001,008,0002,306,048
7Apr 22, 2026 19:1170,96250,282,08024,237,0002,019,0002,371,584
8Apr 22, 2026 19:1171,06443,605,83925,283,0001,011,0002,355,200
9Apr 22, 2026 19:1171,10543,486,59625,298,0001,011,0002,367,488