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 29, 2025 18:12zielajzielajScore: 3,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 18:123,635142,831,589111,945,0007,996,0002,416,640
2Dec 29, 2025 18:123,636141,039,562113,984,0005,999,0002,416,640
3Dec 29, 2025 18:123,643141,495,905112,193,0008,013,0002,490,368
4Dec 29, 2025 18:123,656145,979,505111,686,0008,974,0002,314,240
5Dec 29, 2025 18:123,659141,783,543112,755,0007,982,0002,400,256
6Dec 29, 2025 18:123,659145,115,123111,759,0008,980,0002,318,336
7Dec 29, 2025 18:123,667142,209,004113,004,0008,000,0002,363,392
8Dec 29, 2025 18:123,671143,311,548114,130,0007,008,0002,469,888
9Dec 29, 2025 18:123,756145,830,052116,960,0006,997,0002,375,680