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 19, 2021 13:36Yuriy LyfenkoYuriy LyfenkoScore: 113,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2021 13:36109,454574,420,87039,486,0001,012,0002,326,528
2Jul 19, 2021 13:36110,735567,322,77038,974,0001,998,0002,326,528
3Jul 19, 2021 13:36111,935569,907,40640,406,0001,010,0002,371,584
4Jul 19, 2021 13:36112,046566,320,53939,435,0002,022,0002,326,528
5Jul 19, 2021 13:36112,114575,386,57939,459,0002,023,0002,326,528
6Jul 19, 2021 13:36112,355596,621,36541,571,49902,248,704
7Jul 19, 2021 13:36113,935568,898,13439,145,0003,011,0002,326,528
8Jul 19, 2021 13:36114,681562,255,44740,412,0002,020,0002,330,624
9Jul 19, 2021 13:36114,824569,012,88440,462,0002,023,0002,330,624
10Jul 19, 2021 13:36116,032563,341,37139,937,0002,995,0002,498,560
11Jul 19, 2021 13:36116,800611,788,45343,215,96502,174,976
12Jul 19, 2021 13:36117,328621,018,44743,411,53502,187,264