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 18:53Yuriy LyfenkoYuriy LyfenkoScore: 64,405Success
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 18:5364,230556,063,06321,785,0001,980,0002,285,568
2Jul 13, 2021 18:5364,232561,439,41722,776,000990,0002,285,568
3Jul 13, 2021 18:5364,238548,831,79821,788,0001,980,0002,285,568
4Jul 13, 2021 18:5364,286551,249,94421,804,0001,982,0002,281,472
5Jul 13, 2021 18:5364,330552,254,83221,819,0001,983,0002,285,568
6Jul 13, 2021 18:5364,386546,450,67121,838,0001,985,0002,269,184
7Jul 13, 2021 18:5364,405544,951,14021,845,0001,985,0002,281,472
8Jul 13, 2021 18:5364,438545,586,49621,856,0001,986,0002,285,568
9Jul 13, 2021 18:5364,451550,191,28721,860,0001,987,0002,281,472
10Jul 13, 2021 18:5366,942581,083,53324,768,46702,248,704
11Jul 13, 2021 18:5367,035598,236,33524,802,82502,244,608
12Jul 13, 2021 18:5367,330598,163,57824,912,05702,248,704