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 20, 2025 08:29Rajarshi BasuRajarshi BasuScore: 5,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 08:295,177192,936,586168,853,0001,998,0002,392,064
2Dec 20, 2025 08:295,213197,150,956166,018,0006,000,0002,469,888
3Dec 20, 2025 08:295,218193,944,143166,191,0006,006,0002,519,040
4Dec 20, 2025 08:295,223193,978,684166,332,0006,012,0002,375,680
5Dec 20, 2025 08:295,225201,701,083166,407,0006,014,0002,523,136
6Dec 20, 2025 08:295,227202,020,706165,474,0007,020,0002,527,232
7Dec 20, 2025 08:295,233197,866,007165,696,0006,987,0002,375,680
8Dec 20, 2025 08:295,295200,449,883168,732,0005,990,0002,351,104
9Dec 20, 2025 08:295,391200,118,026172,898,0004,997,0002,527,232