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 16, 2023 16:35Paul MasurelPaul MasurelScore: 71,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 16:3570,31451,503,01125,016,0001,000,0002,355,200
2Jul 16, 2023 16:3570,40356,685,25024,046,0002,003,0002,281,472
3Jul 16, 2023 16:3570,49753,158,05424,078,0002,006,0002,281,472
4Jul 16, 2023 16:3570,55953,065,45424,099,0002,008,0002,281,472
5Jul 16, 2023 16:3570,59751,919,93424,112,0002,009,0002,285,568
6Jul 16, 2023 16:3571,02453,826,99525,269,0001,010,0002,363,392
7Jul 16, 2023 16:3571,05147,385,81324,267,0002,022,0002,367,488
8Jul 16, 2023 16:3571,29251,285,46825,364,0001,014,0002,367,488
9Jul 16, 2023 16:3571,33848,120,42126,395,00002,473,984
10Jul 16, 2023 16:3573,37084,101,79527,146,81302,191,360
11Jul 16, 2023 16:3573,619105,406,18727,239,00602,195,456
12Jul 16, 2023 16:3573,76396,983,82127,292,14202,195,456