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:47M-RochatM-RochatScore: 23,225Success
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:4822,871763,752,024749,609,0005,165,0002,113,536
2May 16, 2026 08:4823,067773,075,739755,953,0005,282,0002,113,536
3May 16, 2026 08:4823,133773,603,145758,187,0005,202,0002,113,536
4May 16, 2026 08:4823,134774,207,643758,235,0005,207,0002,113,536
5May 16, 2026 08:4823,225775,792,467761,342,0005,087,0002,113,536
6May 16, 2026 08:4823,246777,777,065762,094,0005,043,0002,113,536
7May 16, 2026 08:4823,382780,529,394766,434,0005,184,0002,113,536
8May 16, 2026 08:4823,450783,282,666768,642,0005,213,0002,113,536
9May 16, 2026 08:4823,780793,665,926779,731,0005,014,0002,113,536