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 listJun 7, 2026 17:51anboto1anboto1Score: 22,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 17:5222,542753,225,684737,219,0006,681,0002,113,536
2Jun 7, 2026 17:5222,666757,361,191741,159,0006,824,0002,113,536
3Jun 7, 2026 17:5222,716758,960,815743,034,0006,609,0002,113,536
4Jun 7, 2026 17:5222,738760,152,534743,720,0006,664,0002,113,536
5Jun 7, 2026 17:5222,750760,054,928744,130,0006,641,0002,113,536
6Jun 7, 2026 17:5222,904765,417,646749,093,0006,759,0002,113,536
7Jun 7, 2026 17:5223,753793,194,252777,002,0006,873,0002,113,536
8Jun 7, 2026 17:5223,882797,767,949781,266,0006,870,0002,113,536
9Jun 7, 2026 17:5223,905798,173,229782,090,0006,783,0002,113,536