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 27, 2026 22:38Charles CabergsCharles CabergsScore: 72,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:4072,65642,549,65022,901,0003,982,0002,433,024
2Apr 27, 2026 22:4072,67549,821,31324,899,0001,991,0002,363,392
3Apr 27, 2026 22:4072,73246,253,04624,918,0001,993,0002,355,200
4Apr 27, 2026 22:4072,73744,003,44924,920,0001,993,0002,355,200
5Apr 27, 2026 22:4072,75943,185,52224,927,0001,994,0002,371,584
6Apr 27, 2026 22:4072,80042,242,26924,941,0001,995,0002,363,392
7Apr 27, 2026 22:4072,82738,977,46424,950,0001,996,0002,297,856
8Apr 27, 2026 22:4072,85942,317,89422,965,0003,993,0002,428,928
9Apr 27, 2026 22:4072,95444,432,45325,955,0001,038,0002,367,488