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:23Rajarshi BasuRajarshi BasuScore: 4,930Success
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:234,900191,484,721157,701,0003,992,0002,506,752
2Dec 22, 2025 10:234,908186,191,352157,973,0003,999,0002,437,120
3Dec 22, 2025 10:234,919183,781,420158,312,0004,007,0002,510,848
4Dec 22, 2025 10:234,921194,172,350158,371,0004,009,0002,273,280
5Dec 22, 2025 10:234,930193,044,633158,703,0003,992,0002,334,720
6Dec 22, 2025 10:234,934187,332,392157,838,0004,994,0002,510,848
7Dec 22, 2025 10:234,938190,980,024158,971,0003,999,0002,351,104
8Dec 22, 2025 10:234,998188,931,392160,946,0003,998,0002,293,760
9Dec 22, 2025 10:235,002186,887,986160,068,0005,002,0002,347,008