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 20:52Josu San MartinJosu San MartinScore: 3,415Success
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 20:533,381122,375,705110,543,0001,040,0002,113,536
2May 13, 2026 20:533,383122,090,061110,606,0001,045,0002,113,536
3May 13, 2026 20:533,392120,720,513110,885,0001,057,0002,113,536
4May 13, 2026 20:533,414123,587,331111,632,0001,054,0002,113,536
5May 13, 2026 20:533,415122,924,260111,682,0001,044,0002,113,536
6May 13, 2026 20:533,418123,676,150111,791,0001,032,0002,113,536
7May 13, 2026 20:533,419124,239,831111,829,0001,027,0002,113,536
8May 13, 2026 20:533,426124,078,060112,012,0001,051,0002,113,536
9May 13, 2026 20:533,427123,908,278112,064,0001,035,0002,113,536