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 22, 2025 10:57Rajarshi BasuRajarshi BasuScore: 4,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 10:584,826179,680,162157,267,0002,003,0002,392,064
2Dec 22, 2025 10:574,827186,576,358156,285,0003,005,0002,285,568
3Dec 22, 2025 10:584,832186,908,582156,441,0003,008,0002,285,568
4Dec 22, 2025 10:584,834184,321,590157,502,0002,006,0002,285,568
5Dec 22, 2025 10:584,845183,272,838157,879,0001,998,0002,285,568
6Dec 22, 2025 10:584,860185,468,355157,362,0003,006,0002,285,568
7Dec 22, 2025 10:584,864185,484,011158,495,0002,006,0002,387,968
8Dec 22, 2025 10:584,870188,672,660158,718,0001,996,0002,281,472
9Dec 22, 2025 10:584,929187,818,447159,668,0002,993,0002,494,464
10Dec 22, 2025 10:574,948188,874,299161,284,0002,003,0002,392,064
11Dec 22, 2025 10:585,033192,611,254164,098,0002,001,0002,383,872
12Dec 22, 2025 10:575,149196,117,968167,918,0001,999,0002,392,064