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 listAug 2, 2022 20:22Yuriy LyfenkoYuriy LyfenkoScore: 61,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 20:2261,305544,727,39522,683,00002,289,664
2Aug 2, 2022 20:2261,532554,258,68521,778,000989,0002,277,376
3Aug 2, 2022 20:2261,543551,122,89620,791,0001,980,0002,277,376
4Aug 2, 2022 20:2261,557554,501,40420,796,0001,980,0002,289,664
5Aug 2, 2022 20:2261,619548,248,76020,817,0001,982,0002,285,568
6Aug 2, 2022 20:2261,727545,673,81120,853,0001,986,0002,269,184
7Aug 2, 2022 20:2261,754544,660,96320,863,0001,986,0002,281,472
8Aug 2, 2022 20:2261,781547,819,81720,872,0001,987,0002,285,568
9Aug 2, 2022 20:2261,808547,854,20721,875,000994,0002,281,472
10Aug 2, 2022 20:2263,987591,829,84223,675,00602,248,704
11Aug 2, 2022 20:2264,139584,145,66423,731,42102,252,800
12Aug 2, 2022 20:2264,304594,469,52923,792,42902,248,704