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 listOct 17, 2026 06:19e1011e1011Score: 81,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 06:2181,5342,702,182,3772,685,744,0004,905,0002,113,536
2Oct 17, 2026 06:2181,5342,702,998,5282,685,763,0004,867,0002,113,536
3Oct 17, 2026 06:2181,6032,704,273,3402,688,264,0004,645,0002,113,536
4Oct 17, 2026 06:2181,6532,705,493,7752,689,891,0004,672,0002,113,536
5Oct 17, 2026 06:2181,8652,712,462,7092,696,884,0004,679,0002,113,536
6Oct 17, 2026 06:2182,2532,725,361,4852,709,472,0004,879,0002,113,536
7Oct 17, 2026 06:2183,0552,751,851,5562,735,722,0005,125,0002,113,536
8Oct 17, 2026 06:2183,8662,779,001,2272,762,879,0004,703,0002,113,536
9Oct 17, 2026 06:2184,5492,801,125,7992,785,441,0004,690,0002,113,536