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,270Success
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,220199,189,889168,242,0004,005,0002,281,472
2Dec 20, 2025 08:235,233200,061,886166,715,0005,989,0002,527,232
3Dec 20, 2025 08:235,250198,910,038169,251,0004,005,0002,342,912
4Dec 20, 2025 08:235,264197,957,349165,741,0007,987,0002,297,856
5Dec 20, 2025 08:235,270201,600,262169,904,0003,997,0002,318,336
6Dec 20, 2025 08:235,274202,272,218169,033,0005,000,0002,404,352
7Dec 20, 2025 08:235,284195,504,029170,351,0004,008,0002,514,944
8Dec 20, 2025 08:235,314200,945,926170,349,0005,010,0002,531,328
9Dec 20, 2025 08:235,409203,964,427171,520,0006,980,0002,301,952