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 16, 2025 09:38AndreiAndreiScore: 93,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 09:3892,8093,092,427,7802,975,735,00086,963,0002,461,696
2Dec 16, 2025 09:3893,2193,102,449,9892,980,290,00095,944,0002,543,616
3Dec 16, 2025 09:3893,3573,105,039,8982,973,833,000106,958,0002,543,616
4Dec 16, 2025 09:3893,4083,112,293,5912,988,510,00093,953,0002,297,856
5Dec 16, 2025 09:3893,5393,114,252,4222,981,834,000104,958,0002,543,616
6Dec 16, 2025 09:3893,6883,119,586,3422,994,735,00096,959,0002,494,464
7Dec 16, 2025 09:3894,0353,133,696,3373,002,179,000100,972,0002,486,272
8Dec 16, 2025 09:3894,5463,150,482,7783,025,082,00094,939,0002,535,424
9Dec 16, 2025 09:3894,6473,153,837,2343,043,402,00079,958,0002,543,616