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 13:21AnSaAnSaScore: 107,689Success
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 13:21106,54365,947,26837,400,0002,021,0002,277,376
2Jan 29, 2024 13:21106,88966,696,25337,521,0002,028,0002,265,088
3Jan 29, 2024 13:21107,07667,672,73238,603,0001,015,0002,265,088
4Jan 29, 2024 13:21107,28168,213,45038,702,000992,0002,265,088
5Jan 29, 2024 13:21107,59265,302,33438,814,000995,0002,277,376
6Jan 29, 2024 13:21107,66269,766,05137,844,0001,991,0002,277,376
7Jan 29, 2024 13:21107,68969,917,52537,853,0001,992,0002,527,232
8Jan 29, 2024 13:21107,92462,489,42637,936,0001,996,0002,523,136
9Jan 29, 2024 13:21108,27859,668,92238,060,0002,003,0002,265,088
10Jan 29, 2024 13:21109,993108,245,24540,697,39802,260,992
11Jan 29, 2024 13:21110,76297,670,61040,982,10002,273,280
12Jan 29, 2024 13:21111,266103,285,60341,168,29302,256,896