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 13:00Yuriy LyfenkoYuriy LyfenkoScore: 61,746Success
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 13:0061,543556,323,14921,781,000990,0002,273,280
2Aug 2, 2022 13:0061,551548,473,37720,794,0001,980,0002,289,664
3Aug 2, 2022 13:0061,554550,085,20820,795,0001,980,0002,289,664
4Aug 2, 2022 13:0061,603555,673,52620,811,0001,982,0002,285,568
5Aug 2, 2022 13:0061,646547,395,56820,826,0001,983,0002,281,472
6Aug 2, 2022 13:0061,708546,598,31520,847,0001,985,0002,375,680
7Aug 2, 2022 13:0061,746549,162,38320,860,0001,986,0002,281,472
8Aug 2, 2022 13:0061,749549,081,72620,861,0001,986,0002,281,472
9Aug 2, 2022 13:0061,873543,486,50321,898,000995,0002,281,472
10Aug 2, 2022 13:0064,002591,756,59023,680,92102,248,704
11Aug 2, 2022 13:0064,183589,230,42923,747,54902,273,280
12Aug 2, 2022 13:0064,296584,907,58823,789,60202,248,704