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 listApr 16, 2026 16:17olliecrowolliecrowScore: 22,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 17:2922,252759,924,124706,349,00027,974,0002,412,544
2Apr 16, 2026 17:2922,291758,823,833709,628,00025,986,0002,494,464
3Apr 16, 2026 17:2922,359765,517,351711,859,00025,994,0002,449,408
4Apr 16, 2026 16:1722,518778,013,866717,098,00026,003,0002,408,448
5Apr 16, 2026 16:1722,527763,418,121717,428,00025,979,0002,486,272
6Apr 16, 2026 16:1722,564780,027,254718,615,00025,986,0002,396,160