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 21, 2025 05:01Rajarshi BasuRajarshi BasuScore: 5,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 05:005,049191,563,691160,640,0005,986,0002,371,584
2Dec 21, 2025 05:005,080195,668,952161,666,0005,987,0002,514,944
3Dec 21, 2025 05:015,093193,712,367163,071,0005,002,0002,359,296
4Dec 21, 2025 05:005,121199,948,549165,993,0002,999,0002,400,256
5Dec 21, 2025 05:015,315204,971,177169,367,0006,013,0002,465,792
6Dec 21, 2025 05:015,317201,317,057172,458,0003,007,0002,510,848