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 listMay 16, 2026 08:17M-RochatM-RochatScore: 100,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:1996,3143,191,589,7523,167,526,00010,840,0002,113,536
2May 16, 2026 08:1996,9033,206,907,6643,187,123,00010,690,0002,113,536
3May 16, 2026 08:1998,7533,268,089,6383,248,047,00010,810,0002,113,536
4May 16, 2026 08:19100,1813,316,952,2503,296,503,0009,481,0002,113,536
5May 16, 2026 08:19100,7193,332,548,5393,313,344,00010,395,0002,113,536
6May 16, 2026 08:19101,1363,348,438,2273,326,971,00010,542,0002,113,536
7May 16, 2026 08:19101,3393,355,302,8063,333,884,00010,306,0002,113,536
8May 16, 2026 08:19101,3993,355,040,8633,335,796,00010,387,0002,113,536
9May 16, 2026 08:19102,4633,391,479,5293,370,546,00010,736,0002,113,536