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 listJan 28, 2025 09:14mebowlermebowlerScore: 274,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:14272,581129,376,42259,914,00040,941,0002,400,256
2Jan 28, 2025 09:14273,119123,733,16053,028,00048,026,0002,404,352
3Jan 28, 2025 09:14273,508126,715,06359,116,00042,082,0002,392,064
4Jan 28, 2025 09:14273,781124,990,12357,169,00044,130,0002,297,856
5Jan 28, 2025 09:14274,616130,363,82958,349,00043,259,0002,297,856
6Jan 28, 2025 09:14275,800130,078,59155,025,00047,021,0002,392,064
7Jan 28, 2025 09:14276,219127,850,74364,126,00038,075,0002,297,856
8Jan 28, 2025 09:14277,200133,455,66759,326,00043,238,0002,297,856
9Jan 28, 2025 09:14277,335128,047,66651,307,00051,307,0002,392,064