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:51M-RochatM-RochatScore: 26,978Success
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:5226,792893,047,885876,855,0007,285,0002,113,536
2May 16, 2026 08:5226,855895,232,265878,942,0007,293,0002,113,536
3May 16, 2026 08:5226,880897,920,012880,126,0006,936,0002,113,536
4May 16, 2026 08:5226,959901,523,226882,794,0006,863,0002,113,536
5May 16, 2026 08:5226,978899,089,494883,190,0007,089,0002,113,536
6May 16, 2026 08:5226,990901,718,817883,841,0006,860,0002,113,536
7May 16, 2026 08:5227,116903,859,304887,729,0007,107,0002,113,536
8May 16, 2026 08:5227,661924,256,292903,708,0009,130,0002,113,536
9May 16, 2026 08:5228,904963,036,189946,349,0007,509,0002,113,536