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 listMar 25, 2023 20:26Yurkov AlekseyYurkov AlekseyScore: 119,946Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 20:2699,07597,622,41036,657,71302,260,992
2Mar 25, 2023 20:2699,195100,454,56736,701,96802,269,184
3Mar 25, 2023 20:26100,229113,269,18037,084,80102,265,088
4Mar 25, 2023 20:26119,45970,027,54642,191,0002,009,0002,269,184
5Mar 25, 2023 20:26119,79769,267,45842,311,0002,014,0002,289,664
6Mar 25, 2023 20:26119,94169,364,10342,361,0002,017,0002,289,664
7Mar 25, 2023 20:26119,94671,666,84544,380,00002,277,376
8Mar 25, 2023 20:26119,95466,973,65242,366,0002,017,0002,281,472
9Mar 25, 2023 20:26119,97365,073,13743,382,0001,008,0002,273,280
10Mar 25, 2023 20:26120,02769,580,79943,401,0001,009,0002,277,376
11Mar 25, 2023 20:26120,37665,966,04343,527,0001,012,0002,277,376
12Mar 25, 2023 20:26120,59269,979,81144,619,00002,371,584