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 listJul 24, 2024 17:48AnSaAnSaScore: 75,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 17:4874,78655,429,23127,671,00002,277,376
2Jul 24, 2024 17:4874,81657,307,73625,632,0002,050,0002,277,376
3Jul 24, 2024 17:4874,81960,273,97526,658,0001,025,0002,277,376
4Jul 24, 2024 17:4875,15956,161,97625,823,0001,986,0002,277,376
5Jul 24, 2024 17:4875,20553,845,31126,833,000993,0002,277,376
6Jul 24, 2024 17:4875,22756,075,44024,852,0002,982,0002,289,664
7Jul 24, 2024 17:4875,25950,794,99624,863,0002,983,0002,277,376
8Jul 24, 2024 17:4875,26854,536,48625,860,0001,989,0002,281,472
9Jul 24, 2024 17:4875,27352,905,24624,867,0002,984,0002,277,376
10Jul 24, 2024 17:4879,61794,611,87729,458,39102,273,280
11Jul 24, 2024 17:4879,743107,368,29129,504,89102,211,840
12Jul 24, 2024 17:4879,76296,624,17729,512,05402,273,280