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 listMay 3, 2026 19:57TudyMTudyMScore: 25,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:0125,082843,420,088798,161,00029,571,0002,473,984
2May 3, 2026 20:0125,129846,558,245799,724,00029,554,0002,473,984
3May 3, 2026 20:0125,157846,634,105801,125,00029,073,0002,478,080
4May 3, 2026 20:0125,234846,806,296803,596,00029,150,0002,478,080
5May 3, 2026 20:0125,251849,433,247803,743,00029,556,0002,482,176
6May 3, 2026 20:0125,319853,756,793806,030,00029,500,0002,478,080
7May 3, 2026 20:0125,371854,220,896807,736,00029,509,0002,478,080
8May 3, 2026 20:0125,379854,151,850807,290,00030,247,0002,473,984
9May 3, 2026 20:0125,716873,782,229819,532,00029,101,0002,478,080