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 12:55Yuriy 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 12:5561,419548,620,76720,749,0001,976,0002,281,472
2Aug 2, 2022 12:5561,511553,135,59221,770,000989,0002,285,568
3Aug 2, 2022 12:5561,554550,808,68921,785,000990,0002,285,568
4Aug 2, 2022 12:5561,559548,040,51220,797,0001,980,0002,375,680
5Aug 2, 2022 12:5561,576549,866,70921,793,000990,0002,281,472
6Aug 2, 2022 12:5561,584547,909,77620,805,0001,981,0002,289,664
7Aug 2, 2022 12:5561,746552,866,85020,860,0001,986,0002,281,472
8Aug 2, 2022 12:5561,770550,253,69820,868,0001,987,0002,285,568
9Aug 2, 2022 12:5564,125587,781,05023,726,24102,248,704
10Aug 2, 2022 12:5564,141585,510,83423,732,11302,252,800
11Aug 2, 2022 12:5564,195589,311,09923,752,02002,252,800
12Aug 2, 2022 12:55207,259603,194,63474,695,0001,991,0002,281,472