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 14, 2022 19:44Franek KortaFranek KortaScore: 75,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 19:4475,27661,322,84524,868,0002,984,0002,314,240
2Aug 14, 2022 19:4475,31162,000,95926,870,000995,0002,473,984
3Aug 14, 2022 19:4475,44356,662,48725,921,0001,993,0002,334,720
4Aug 14, 2022 19:4475,54953,365,29926,955,000998,0002,293,760
5Aug 14, 2022 19:4475,63253,404,64026,985,000999,0002,465,792
6Aug 14, 2022 19:4475,67852,032,75926,001,0002,000,0002,457,600
7Aug 14, 2022 19:4475,72452,958,57425,016,0003,002,0002,453,504
8Aug 14, 2022 19:4476,13062,401,79326,156,0002,012,0002,437,120
9Aug 14, 2022 19:4476,18955,295,54827,184,0001,006,0002,453,504
10Aug 14, 2022 19:4479,40497,977,85129,379,56102,191,360
11Aug 14, 2022 19:4480,44489,854,71029,764,28002,301,952
12Aug 14, 2022 19:4480,45891,034,59429,769,38302,293,760