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 10, 2025 21:31Chandrasekaran AkashChandrasekaran AkashScore: 21,170,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2025 21:3121,066,4627,828,425,5827,595,755,000198,836,0002,281,472
2Apr 10, 2025 21:3121,105,7057,846,226,2187,610,287,000198,824,0002,306,048
3Apr 10, 2025 21:3121,161,9687,866,985,5107,631,108,000198,820,0002,281,472
4Apr 10, 2025 21:3121,169,5087,864,841,3027,637,875,000194,843,0002,281,472
5Apr 10, 2025 21:3121,170,8417,867,860,0777,635,383,000197,828,0002,306,048
6Apr 10, 2025 21:3121,174,6167,866,852,0277,628,776,000205,832,0002,281,472
7Apr 10, 2025 21:3121,174,8977,872,459,0937,636,871,000197,841,0002,281,472
8Apr 10, 2025 21:3121,208,6737,877,955,5797,657,374,000189,835,0002,281,472
9Apr 10, 2025 21:3121,250,8577,894,657,8517,663,974,000198,843,0002,363,392