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 listOct 13, 2024 08:34Vladimir TatVladimir TatScore: 127,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 08:31127,0864,229,919,5454,174,855,00018,985,0002,318,336
2Oct 13, 2024 08:34127,1124,219,454,8644,180,715,00013,992,0002,359,296
3Oct 13, 2024 08:31127,4074,236,750,8474,185,433,00018,983,0002,277,376
4Oct 13, 2024 08:31127,9054,251,084,2744,203,881,00016,987,0002,392,064
5Oct 13, 2024 08:34128,1724,256,055,7014,212,679,00016,990,0002,347,008
6Oct 13, 2024 08:34130,6844,342,526,6384,290,595,00021,982,0002,514,944