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 5, 2022 21:25Franek KortaFranek KortaScore: 77,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:2576,64352,382,08026,333,0002,025,0002,281,472
2Aug 5, 2022 21:2577,03053,537,66527,484,0001,017,0002,281,472
3Aug 5, 2022 21:2577,07653,010,17227,500,0001,018,0002,527,232
4Aug 5, 2022 21:2577,12454,781,44328,536,00002,527,232
5Aug 5, 2022 21:2577,25749,363,62127,565,0001,020,0002,523,136
6Aug 5, 2022 21:2577,34654,621,47125,552,0003,066,0002,273,280
7Aug 5, 2022 21:2577,46861,889,95126,616,0002,047,0002,281,472
8Aug 5, 2022 21:2577,91960,733,57126,842,0001,988,0002,281,472
9Aug 5, 2022 21:2577,98158,195,06627,859,000994,0002,281,472
10Aug 5, 2022 21:2582,42291,466,89030,496,19002,281,472
11Aug 5, 2022 21:2583,17091,471,53330,772,73202,269,184
12Aug 5, 2022 21:2583,20993,116,71830,787,23402,252,800