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 20, 2025 08:23Rajarshi BasuRajarshi BasuScore: 5,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 08:235,186192,421,232165,142,0006,005,0002,412,544
2Dec 20, 2025 08:235,205199,118,178167,755,0003,994,0002,420,736
3Dec 20, 2025 08:235,209200,492,859165,908,0005,996,0002,514,944
4Dec 20, 2025 08:235,220194,802,365167,250,0005,007,0002,482,176
5Dec 20, 2025 08:235,231203,014,738165,642,0006,984,0002,502,656
6Dec 20, 2025 08:235,240199,251,522166,911,0005,996,0002,514,944
7Dec 20, 2025 08:235,243200,318,525169,024,0004,000,0002,326,528
8Dec 20, 2025 08:235,378206,661,721171,506,0005,982,0002,465,792
9Dec 20, 2025 08:235,682219,463,513181,529,0005,984,0002,498,560