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 listJan 3, 2026 05:43Rajarshi BasuRajarshi BasuScore: 3,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 05:443,280134,420,084105,225,0003,006,0002,527,232
2Jan 3, 2026 05:433,287139,280,396104,465,0004,017,0002,297,856
3Jan 3, 2026 05:443,288141,967,109104,472,0004,018,0002,514,944
4Jan 3, 2026 05:443,290136,716,375104,552,0004,021,0002,297,856
5Jan 3, 2026 05:443,298130,787,233104,839,0003,993,0002,338,816
6Jan 3, 2026 05:443,304129,816,599106,043,0003,001,0002,367,488
7Jan 3, 2026 05:433,312131,327,516106,293,0003,008,0002,297,856
8Jan 3, 2026 05:443,319137,607,521105,500,0004,019,0002,510,848
9Jan 3, 2026 05:433,338134,813,504106,133,0004,005,0002,424,832