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 listFeb 13, 2026 10:48FuroremFuroremScore: 265,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 10:48264,1838,751,404,8938,614,112,000103,941,0002,281,472
2Feb 13, 2026 10:48264,6068,774,061,1238,628,075,000103,928,0002,416,640
3Feb 13, 2026 10:48265,5758,794,824,6578,664,059,00099,931,0002,363,392
4Feb 13, 2026 10:48265,7218,799,421,7948,661,866,000106,936,0002,334,720
5Feb 13, 2026 10:48265,9188,808,704,5718,676,366,00098,935,0002,297,856
6Feb 13, 2026 10:48266,0628,818,660,8528,665,129,000114,922,0002,318,336
7Feb 13, 2026 10:48266,2418,816,478,1668,679,037,000106,926,0002,310,144
8Feb 13, 2026 10:48266,8068,838,224,3368,697,652,000106,934,0002,437,120
9Feb 13, 2026 10:48266,8938,842,532,0008,711,528,00095,939,0002,297,856