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 19:08Yuriy LyfenkoYuriy LyfenkoScore: 61,781Success
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 19:0861,535548,453,32120,789,0001,979,0002,392,064
2Aug 2, 2022 19:0861,546554,802,09820,792,0001,980,0002,273,280
3Aug 2, 2022 19:0861,554545,910,46221,785,000990,0002,285,568
4Aug 2, 2022 19:0861,665550,388,05921,824,000992,0002,281,472
5Aug 2, 2022 19:0861,695544,336,66920,842,0001,985,0002,281,472
6Aug 2, 2022 19:0861,719547,811,30920,851,0001,985,0002,285,568
7Aug 2, 2022 19:0861,781545,232,45220,872,0001,987,0002,281,472
8Aug 2, 2022 19:0861,803546,948,39720,879,0001,988,0002,281,472
9Aug 2, 2022 19:0862,127545,450,14020,989,0001,998,0002,281,472
10Aug 2, 2022 19:0864,026597,512,43223,689,64302,252,800
11Aug 2, 2022 19:0864,028599,422,16523,690,25002,256,896
12Aug 2, 2022 19:0864,300583,537,46123,790,97902,260,992