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 14, 2021 09:57Andrey TsvetkovAndrey TsvetkovScore: 93,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 09:5792,72758,834,50232,291,0002,018,0002,334,720
2Jul 14, 2021 09:5792,97854,681,71432,379,0002,023,0002,371,584
3Jul 14, 2021 09:5793,20557,231,18632,458,0002,028,0002,514,944
4Jul 14, 2021 09:5793,25158,219,49032,474,0002,029,0002,334,720
5Jul 14, 2021 09:5793,30561,588,01832,493,0002,030,0002,510,848
6Jul 14, 2021 09:5793,43063,432,06834,569,00002,334,720
7Jul 14, 2021 09:5793,61659,689,26433,620,0001,018,0002,510,848
8Jul 14, 2021 09:5794,19563,699,89832,861,0001,991,0002,326,528
9Jul 14, 2021 09:5794,28163,703,51533,888,000996,0002,502,656
10Jul 14, 2021 09:5796,426105,022,47735,677,51302,297,856
11Jul 14, 2021 09:5796,75697,003,83735,799,76502,183,168
12Jul 14, 2021 09:5796,93099,340,34435,864,24502,301,952