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 listAug 17, 2026 13:08Tomislav TunkovicTomislav TunkovicScore: 3,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:153,162112,770,857102,332,0002,031,00028,672
2Aug 17, 2026 13:153,173116,819,077102,561,0002,178,00028,672
3Aug 17, 2026 13:153,179113,289,663102,752,0002,177,00028,672
4Aug 17, 2026 13:153,196113,943,955103,367,0002,106,00028,672
5Aug 17, 2026 13:153,201113,945,155103,567,0002,094,00028,672
6Aug 17, 2026 13:153,203114,137,927103,655,0002,071,00028,672
7Aug 17, 2026 13:153,204114,177,616103,614,0002,131,00028,672
8Aug 17, 2026 13:153,210114,426,675103,734,0002,215,00028,672
9Aug 17, 2026 13:153,292117,225,613106,557,0002,085,00028,672