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 15:28Josu San MartinJosu San MartinScore: 55,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:0055,0371,847,398,3401,775,255,00040,982,0002,433,024
2Dec 23, 2025 04:0055,1661,848,802,0461,781,503,00038,967,0002,318,336
3Dec 22, 2025 15:2855,3761,859,323,0521,782,407,00044,985,0002,285,568
4Dec 22, 2025 15:2855,9801,873,294,0941,804,367,00042,984,0002,506,752
5Dec 23, 2025 04:0056,1331,881,904,6061,810,399,00041,986,0002,502,656
6Dec 22, 2025 15:2856,1771,883,312,0531,805,872,00047,970,0002,289,664