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, 2025 20:09Steve BronderSteve BronderScore: 68,473Success
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, 2025 20:0968,18452,442,89623,210,0002,018,0002,277,376
2Apr 21, 2025 20:0968,25442,731,93024,244,0001,010,0002,437,120
3Apr 21, 2025 20:0968,35747,112,63824,281,0001,011,0002,437,120
4Apr 21, 2025 20:0968,39748,218,17324,295,0001,012,0002,437,120
5Apr 21, 2025 20:0968,47345,947,98224,322,0001,013,0002,519,040
6Apr 21, 2025 20:0968,70544,134,42624,405,0001,016,0002,277,376
7Apr 21, 2025 20:0968,72751,361,47425,429,00002,428,928
8Apr 21, 2025 20:0968,87346,805,50524,464,0001,019,0002,433,024
9Apr 21, 2025 20:0970,22447,515,95023,985,0001,998,0002,527,232