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 18:11anboto1anboto1Score: 23,951Success
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 18:1223,817795,249,057779,327,0006,664,0002,113,536
2Jun 7, 2026 18:1223,894797,862,404781,621,0006,901,0002,113,536
3Jun 7, 2026 18:1223,904798,240,677782,072,0006,775,0002,113,536
4Jun 7, 2026 18:1223,947799,682,723783,478,0006,800,0002,113,536
5Jun 7, 2026 18:1223,951799,744,406783,706,0006,682,0002,113,536
6Jun 7, 2026 18:1224,005801,600,355785,417,0006,757,0002,113,536
7Jun 7, 2026 18:1224,618821,738,162805,253,0007,157,0002,113,536
8Jun 7, 2026 18:1224,931832,047,774816,728,0006,016,0002,113,536
9Jun 7, 2026 18:1224,957832,869,805816,751,0006,851,0002,113,536