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 24, 2025 13:01caandocaandoScore: 492,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 13:01488,69516,169,024,63816,023,003,000103,941,0002,404,352
2Nov 24, 2025 13:01489,71016,203,231,72216,049,487,000110,934,0002,277,376
3Nov 24, 2025 13:01491,97916,275,202,79616,134,363,000100,939,0002,310,144
4Nov 24, 2025 13:01492,38616,284,000,73216,143,823,000104,927,0002,318,336
5Nov 24, 2025 13:01492,88516,301,964,83816,168,246,00096,947,0002,449,408
6Nov 24, 2025 13:01492,98516,301,513,18616,175,562,00092,945,0002,306,048
7Nov 24, 2025 13:01493,64316,329,361,48316,179,297,000110,926,0002,473,984
8Nov 24, 2025 13:01494,27416,351,732,52316,212,106,00098,933,0002,437,120
9Nov 24, 2025 13:01496,31116,420,086,00716,274,320,000103,938,0002,297,856