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 listDec 19, 2025 19:53Rajarshi BasuRajarshi BasuScore: 6,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:536,803250,863,511218,497,0005,986,0002,510,848
2Dec 19, 2025 19:536,814257,184,714219,869,0004,997,0002,510,848
3Dec 19, 2025 19:536,826250,201,737220,268,0005,006,0002,437,120
4Dec 19, 2025 19:536,828250,311,751220,325,0005,007,0002,260,992
5Dec 19, 2025 19:536,831253,421,759217,441,0007,979,0002,379,776
6Dec 19, 2025 19:536,850248,757,762221,054,0005,001,0002,514,944