Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listMar 4, 2026 03:19Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 08:54Tomislav Tunkovic56.29CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 09:04020,020,953,80239,839,406,000133,386,00069,632Killed by timeout
2Sep 9, 2026 09:0443613,089,27103,527,0002,174,976
3Mar 4, 2026 03:1914,841445,243,4431,231,465,0002,996,0002,551,808
4Mar 4, 2026 03:1915,719471,577,2401,265,739,0002,992,0002,899,968
5Mar 4, 2026 03:1916,272488,150,3711,259,073,0002,995,0002,375,680