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 listFeb 22, 2024 04:01Huy Duc LeHuy Duc LeScore: 72,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 04:0172,51959,015,66422,857,0003,975,0002,510,848
2Feb 22, 2024 04:0172,54157,066,08623,858,0002,982,0002,273,280
3Feb 22, 2024 04:0172,56255,980,43824,860,0001,988,0002,506,752
4Feb 22, 2024 04:0172,56556,142,94522,872,0003,977,0002,281,472
5Feb 22, 2024 04:0172,58454,260,78923,872,0002,984,0002,273,280
6Feb 22, 2024 04:0172,61453,816,60225,872,000995,0002,277,376
7Feb 22, 2024 04:0172,64652,430,75824,888,0001,991,0002,273,280
8Feb 22, 2024 04:0172,80360,575,90623,944,0002,993,0002,363,392
9Feb 22, 2024 04:0173,08659,843,79725,039,0002,003,0002,338,816
10Feb 22, 2024 04:0176,780102,607,54128,408,49002,240,512
11Feb 22, 2024 04:0176,79696,761,66728,414,67302,248,704
12Feb 22, 2024 04:0177,20496,159,32628,565,49002,244,608