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:34Yuriy LyfenkoYuriy LyfenkoScore: 61,735Success
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:3461,519547,528,09920,783,0001,979,0002,285,568
2Aug 2, 2022 12:3461,543547,910,69221,781,000990,0002,281,472
3Aug 2, 2022 12:3461,543548,311,20720,791,0001,980,0002,269,184
4Aug 2, 2022 12:3461,549547,694,45721,783,000990,0002,289,664
5Aug 2, 2022 12:3461,557549,155,94820,796,0001,980,0002,281,472
6Aug 2, 2022 12:3461,619548,741,52820,817,0001,982,0002,289,664
7Aug 2, 2022 12:3461,735547,263,74120,856,0001,986,0002,367,488
8Aug 2, 2022 12:3461,754546,984,87320,863,0001,986,0002,285,568
9Aug 2, 2022 12:3461,770545,968,44120,868,0001,987,0002,285,568
10Aug 2, 2022 12:3464,771587,309,18023,965,14302,252,800
11Aug 2, 2022 12:3464,935602,937,50024,025,97602,260,992
12Aug 2, 2022 12:3464,966587,625,06524,037,51502,252,800