Unique strings Sergey Svistunov

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 listDec 11, 2025 18:29Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 19:32Andrew Epstein15.98CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 19:40039,033,20012,219,00015,500,00016,384Exit with code 1:
2Dec 11, 2025 18:2915,567545,708,072495,717,00017,989,0002,338,816
3Dec 11, 2025 18:2915,651549,461,396495,489,00020,978,0002,412,544
4Dec 11, 2025 18:2915,669542,180,177496,071,00021,003,0002,420,736
5Dec 11, 2025 18:2915,809552,662,673504,722,00016,990,0002,281,472
6Dec 11, 2025 18:2915,922555,802,265510,437,00014,983,0002,400,256
7Dec 11, 2025 18:2915,922554,327,521506,443,00018,979,0002,306,048
8Dec 11, 2025 18:2915,986555,062,816508,550,00018,983,0002,310,144
9Dec 11, 2025 18:2916,005557,095,540503,213,00024,960,0002,338,816
10Dec 11, 2025 18:2916,089564,564,985512,981,00017,964,0002,281,472