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:47Yuriy LyfenkoYuriy LyfenkoScore: 61,576Success
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:4761,514548,432,57020,781,0001,979,0002,527,232
2Aug 2, 2022 12:4761,535555,861,40920,789,0001,979,0002,281,472
3Aug 2, 2022 12:4761,535556,729,11120,789,0001,979,0002,289,664
4Aug 2, 2022 12:4761,543552,794,00121,781,000990,0002,281,472
5Aug 2, 2022 12:4761,562553,634,38621,788,000990,0002,281,472
6Aug 2, 2022 12:4761,573551,433,33020,801,0001,981,0002,285,568
7Aug 2, 2022 12:4761,576551,081,45820,802,0001,981,0002,281,472
8Aug 2, 2022 12:4761,605549,922,72821,803,000991,0002,289,664
9Aug 2, 2022 12:4761,608551,023,04120,813,0001,982,0002,289,664
10Aug 2, 2022 12:4764,042588,162,25323,695,68002,269,184
11Aug 2, 2022 12:4764,044584,148,77123,696,17902,248,704
12Aug 2, 2022 12:4764,275595,268,47523,781,66702,273,280