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:37AnSaAnSaScore: 109,127Success
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:37107,22266,544,88338,655,0001,017,0002,523,136
2Jan 29, 2024 13:37108,02266,188,58237,970,0001,998,0002,375,680
3Jan 29, 2024 13:37108,10365,117,11937,999,0001,999,0002,277,376
4Jan 29, 2024 13:37108,16874,282,81938,021,0002,001,0002,531,328
5Jan 29, 2024 13:37108,45163,391,50838,121,0002,006,0002,519,040
6Jan 29, 2024 13:37109,09262,750,64138,346,0002,018,0002,277,376
7Jan 29, 2024 13:37109,12762,798,13738,359,0002,018,0002,342,912
8Jan 29, 2024 13:37109,60866,985,61539,542,0001,013,0002,523,136
9Jan 29, 2024 13:37111,60065,789,63539,278,0002,014,0002,523,136
10Jan 29, 2024 13:37111,643105,204,13941,307,87602,260,992
11Jan 29, 2024 13:37111,794109,345,81641,363,72002,265,088
12Jan 29, 2024 13:37112,368101,537,16541,576,19502,269,184