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 21, 2026 09:57Charles CabergsCharles CabergsScore: 70,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:5870,38952,634,04424,041,0002,003,0002,379,776
2Apr 21, 2026 09:5870,41653,697,20625,052,0001,002,0002,371,584
3Apr 21, 2026 09:5870,50857,413,33724,082,0002,006,0002,277,376
4Apr 21, 2026 09:5870,59156,689,43224,110,0002,009,0002,367,488
5Apr 21, 2026 09:5870,71356,550,02324,152,0002,012,0002,277,376
6Apr 21, 2026 09:5870,73553,590,59025,166,0001,006,0002,359,296
7Apr 21, 2026 09:5870,85156,688,77825,207,0001,008,0002,371,584
8Apr 21, 2026 09:5870,87255,867,69624,206,0002,017,0002,371,584
9Apr 21, 2026 09:5870,90254,591,59324,216,0002,018,0002,375,680