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 9, 2025 16:33NoSIMD_C#NoSIMD_C#Score: 273,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:33270,905125,829,61957,134,00043,101,0002,293,760
2Apr 9, 2025 16:33271,681124,891,77462,324,00038,198,0002,539,520
3Apr 9, 2025 16:33271,762131,024,80859,326,00041,226,0002,486,272
4Apr 9, 2025 16:33272,500126,665,91255,903,00044,922,0002,461,696
5Apr 9, 2025 16:33273,286127,408,94859,068,00042,048,0002,490,368
6Apr 9, 2025 16:33274,611126,463,97761,366,00040,240,0002,486,272
7Apr 9, 2025 16:33275,119127,439,05858,881,00042,913,0002,289,664
8Apr 9, 2025 16:33276,365126,713,27762,155,00040,100,0002,293,760
9Apr 9, 2025 16:33277,216134,548,30871,397,00031,173,0002,543,616