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 13, 2026 17:46Josu San MartinJosu San MartinScore: 3,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:473,432124,950,612112,210,0001,047,0002,113,536
2May 13, 2026 17:473,436122,857,182112,354,0001,043,0002,117,632
3May 13, 2026 17:473,448122,541,398112,742,0001,043,0002,113,536
4May 13, 2026 17:473,457124,635,320113,046,0001,046,0002,113,536
5May 13, 2026 17:473,460123,994,163113,165,0001,047,0002,113,536
6May 13, 2026 17:473,461123,178,021113,185,0001,042,0002,113,536
7May 13, 2026 17:473,464123,119,496113,278,0001,035,0002,113,536
8May 13, 2026 17:473,467124,738,238113,385,0001,053,0002,113,536
9May 13, 2026 17:473,467125,390,283113,370,0001,052,0002,113,536