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 listApr 3, 2023 21:58Franek KortaFranek KortaScore: 72,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:5870,75446,406,16425,173,0001,006,0002,437,120
2Apr 3, 2023 21:5871,88152,653,74223,528,0003,068,0002,453,504
3Apr 3, 2023 21:5872,00349,138,52526,641,00002,449,408
4Apr 3, 2023 21:5872,08156,199,11525,645,0001,025,0002,441,216
5Apr 3, 2023 21:5872,44151,437,09624,818,0001,985,0002,445,312
6Apr 3, 2023 21:5872,57351,236,37824,863,0001,989,0002,527,232
7Apr 3, 2023 21:5872,59752,519,92425,867,000994,0002,531,328
8Apr 3, 2023 21:5872,60355,399,30525,869,000994,0002,269,184
9Apr 3, 2023 21:5872,61454,866,62725,872,000995,0002,269,184
10Apr 3, 2023 21:5876,382101,245,78928,261,35202,179,072
11Apr 3, 2023 21:5876,54390,359,64128,320,82302,297,856
12Apr 3, 2023 21:5876,62692,984,26128,351,60202,174,976