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 listNov 5, 2026 04:43e1011e1011Score: 30,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:4830,3711,013,196,255970,414,00031,841,0002,113,536
2Nov 5, 2026 04:4830,3901,013,875,280971,113,00031,771,0002,113,536
3Nov 5, 2026 04:4830,3991,014,197,382971,071,00032,117,0002,113,536
4Nov 5, 2026 04:4830,3991,014,025,338971,608,00031,578,0002,113,536
5Nov 5, 2026 04:4830,4091,014,481,023971,905,00031,624,0002,113,536
6Nov 5, 2026 04:4830,4241,015,033,062972,043,00031,970,0002,113,536
7Nov 5, 2026 04:4830,4951,017,423,552974,619,00031,719,0002,113,536
8Nov 5, 2026 04:4830,5071,017,851,076974,981,00031,763,0002,113,536
9Nov 5, 2026 04:4830,5421,020,266,894975,261,00032,650,0002,113,536