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 listNov 1, 2021 10:49Ilya AniskovetsIlya AniskovetsScore: 118,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 10:49117,16868,778,24041,336,0002,016,0002,510,848
2Nov 1, 2021 10:49117,97070,296,22842,634,0001,015,0002,269,184
3Nov 1, 2021 10:49118,03069,028,71243,671,00002,269,184
4Nov 1, 2021 10:49118,11467,980,61343,702,00002,289,664
5Nov 1, 2021 10:49118,13070,603,83442,692,0001,016,0002,531,328
6Nov 1, 2021 10:49118,22469,205,64142,726,0001,017,0002,289,664
7Nov 1, 2021 10:49118,46870,198,79741,841,0001,992,0002,289,664
8Nov 1, 2021 10:49118,50569,783,60141,854,0001,993,0002,269,184
9Nov 1, 2021 10:49118,60068,319,90441,888,0001,994,0002,269,184
10Nov 1, 2021 10:49120,720100,308,06644,666,44802,265,088
11Nov 1, 2021 10:49121,115105,118,94244,812,72702,269,184
12Nov 1, 2021 10:49121,679119,385,40345,021,38102,260,992