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 13, 2021 20:03Yuriy LyfenkoYuriy LyfenkoScore: 88,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 20:0387,35456,570,60830,301,0002,020,0002,498,560
2Jul 13, 2021 20:0387,54358,212,17730,367,0002,024,0002,498,560
3Jul 13, 2021 20:0387,55957,220,73329,360,0003,037,0002,314,240
4Jul 13, 2021 20:0387,59257,145,11730,384,0002,025,0002,494,464
5Jul 13, 2021 20:0388,71958,985,81729,842,0002,984,0002,318,336
6Jul 13, 2021 20:0388,88159,567,59730,893,0001,993,0002,490,368
7Jul 13, 2021 20:0388,95164,763,57830,918,0001,994,0002,293,760
8Jul 13, 2021 20:0388,985102,457,83532,924,57202,297,856
9Jul 13, 2021 20:0389,29696,033,73033,039,65102,289,664
10Jul 13, 2021 20:0389,43861,355,12130,084,0003,008,0002,506,752
11Jul 13, 2021 20:0389,58962,259,81831,139,0002,009,0002,494,464
12Jul 13, 2021 20:0389,67698,315,14633,179,99002,297,856