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 listJan 29, 2024 15:11AnSaAnSaScore: 145,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:11110,115116,317,14140,742,39102,265,088
2Jan 29, 2024 15:11110,51795,589,48040,891,35902,256,896
3Jan 29, 2024 15:11111,284109,638,64641,175,20802,256,896
4Jan 29, 2024 15:11144,35474,874,29635,272,00018,139,0002,269,184
5Jan 29, 2024 15:11144,98179,687,48442,510,00011,133,0002,297,856
6Jan 29, 2024 15:11145,41180,582,42741,846,00011,956,0002,318,336
7Jan 29, 2024 15:11145,50079,755,98236,887,00016,948,0002,277,376
8Jan 29, 2024 15:11145,83576,650,84641,968,00011,991,0002,404,352
9Jan 29, 2024 15:11146,11176,713,85838,043,00016,018,0002,314,240
10Jan 29, 2024 15:11146,34177,528,48038,103,00016,043,0002,334,720
11Jan 29, 2024 15:11146,37677,026,01740,118,00014,041,0002,277,376
12Jan 29, 2024 15:11147,41680,652,86037,373,00017,171,0002,297,856