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 20:10Charles CabergsCharles CabergsScore: 72,621Success
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 20:1172,35645,449,69124,789,0001,983,0002,359,296
2Apr 27, 2026 20:1172,49442,015,69224,837,0001,986,0002,351,104
3Apr 27, 2026 20:1172,56447,282,69224,861,0001,988,0002,359,296
4Apr 27, 2026 20:1172,59746,135,20724,795,0002,066,0002,367,488
5Apr 27, 2026 20:1172,62152,277,00224,880,0001,990,0002,363,392
6Apr 27, 2026 20:1172,67045,569,40124,897,0001,991,0002,367,488
7Apr 27, 2026 20:1172,68943,188,54424,903,0001,992,0002,351,104
8Apr 27, 2026 20:1172,92148,677,46824,983,0001,998,0002,359,296
9Apr 27, 2026 20:1173,04845,698,31325,026,0002,002,0002,351,104