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 13:40Yuriy LyfenkoYuriy LyfenkoScore: 96,246Success
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 13:4095,297556,740,07033,246,0002,014,0002,326,528
2Jul 14, 2021 13:4095,343558,977,85233,262,0002,015,0002,330,624
3Jul 14, 2021 13:4095,435557,755,62232,285,0003,026,0002,326,528
4Jul 14, 2021 13:4095,978563,180,98333,483,0002,029,0002,502,656
5Jul 14, 2021 13:4096,157562,076,56633,545,0002,033,0002,363,392
6Jul 14, 2021 13:4096,189595,226,63535,590,09802,248,704
7Jul 14, 2021 13:4096,246567,803,37834,594,0001,017,0002,326,528
8Jul 14, 2021 13:4096,492605,838,06135,702,12702,260,992
9Jul 14, 2021 13:4097,170558,418,90032,957,0002,996,0002,326,528
10Jul 14, 2021 13:4097,192591,916,57535,961,22302,179,072
11Jul 14, 2021 13:4097,230563,078,02133,977,0001,998,0002,326,528
12Jul 14, 2021 13:4097,278563,509,81034,994,000999,0002,330,624