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 23, 2025 17:41zielajzielajScore: 4,081Success
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 17:414,067156,369,951121,191,00013,020,0002,478,080
2Dec 23, 2025 17:414,073160,097,650123,383,00011,034,0002,355,200
3Dec 23, 2025 17:414,080159,450,806128,652,0005,983,0002,404,352
4Dec 23, 2025 17:414,081161,201,163121,695,00012,967,0002,379,776
5Dec 23, 2025 17:414,081162,576,638124,707,0009,976,0002,392,064
6Dec 23, 2025 17:414,082157,918,401127,728,0006,985,0002,383,872
7Dec 23, 2025 17:414,084156,590,083122,781,00011,978,0002,473,984
8Dec 23, 2025 17:414,088154,248,913128,894,0005,995,0002,400,256
9Dec 23, 2025 17:414,092156,995,250121,040,00014,004,0002,379,776