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 listJul 24, 2024 17:34AnSaAnSaScore: 73,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:3473,34949,618,95825,129,0002,010,0002,277,376
2Jul 24, 2024 17:3473,36852,038,39525,136,0002,010,0002,277,376
3Jul 24, 2024 17:3473,37851,499,53225,139,0002,011,0002,277,376
4Jul 24, 2024 17:3473,41948,624,30825,153,0002,012,0002,277,376
5Jul 24, 2024 17:3473,57856,574,97923,191,0004,033,0002,277,376
6Jul 24, 2024 17:3473,62250,923,76824,214,0003,026,0002,277,376
7Jul 24, 2024 17:3473,63850,442,60525,228,0002,018,0002,277,376
8Jul 24, 2024 17:3473,67850,641,71624,232,0003,029,0002,277,376
9Jul 24, 2024 17:3473,68951,693,63225,246,0002,019,0002,277,376
10Jul 24, 2024 17:3478,278112,685,35328,962,76202,273,280
11Jul 24, 2024 17:3478,29286,391,44828,968,15302,285,568
12Jul 24, 2024 17:3478,587102,468,99429,077,12802,273,280