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 18, 2025 19:28emily graceemily graceScore: 70,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:2869,88452,945,55423,868,0001,989,0002,269,184
2Apr 18, 2025 19:2869,98655,621,55924,860,0001,035,0002,277,376
3Apr 18, 2025 19:2870,03053,815,17424,915,000996,0002,265,088
4Apr 18, 2025 19:2870,23856,052,19823,989,0001,999,0002,269,184
5Apr 18, 2025 19:2870,26554,169,14624,999,000999,0002,289,664
6Apr 18, 2025 19:2870,31448,271,81724,015,0002,001,0002,289,664
7Apr 18, 2025 19:2870,55152,487,09024,096,0002,008,0002,289,664
8Apr 18, 2025 19:2870,65147,917,54024,131,0002,010,0002,273,280
9Apr 18, 2025 19:2875,00850,594,96027,753,00002,281,472