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:35AnSaAnSaScore: 73,514Success
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:3573,32251,358,43026,125,0001,004,0002,273,280
2Jul 24, 2024 17:3573,32752,053,74624,117,0003,014,0002,277,376
3Jul 24, 2024 17:3573,35148,930,50724,125,0003,015,0002,387,968
4Jul 24, 2024 17:3573,36549,511,28623,124,0004,021,0002,277,376
5Jul 24, 2024 17:3573,38650,969,74424,136,0003,017,0002,531,328
6Jul 24, 2024 17:3573,47350,690,84326,179,0001,006,0002,273,280
7Jul 24, 2024 17:3573,51453,794,27926,193,0001,007,0002,277,376
8Jul 24, 2024 17:3573,55752,899,89624,192,0003,024,0002,273,280
9Jul 24, 2024 17:3573,73858,868,37225,262,0002,021,0002,277,376
10Jul 24, 2024 17:3578,09693,891,38728,895,64002,269,184
11Jul 24, 2024 17:3578,386101,470,01229,002,98102,265,088
12Jul 24, 2024 17:3578,689103,955,27929,115,08502,269,184