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 08:11Rajarshi BasuRajarshi BasuScore: 5,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 08:114,998191,292,827160,926,0003,998,0002,506,752
2Dec 22, 2025 08:115,000190,379,316160,012,0005,000,0002,523,136
3Dec 22, 2025 08:115,009195,094,890159,278,0006,010,0002,523,136
4Dec 22, 2025 08:115,012192,860,416160,387,0005,012,0002,289,664
5Dec 22, 2025 08:115,016192,245,491158,534,0006,979,0002,523,136
6Dec 22, 2025 08:115,023187,846,848159,761,0005,991,0002,289,664
7Dec 22, 2025 08:115,029195,482,396159,947,0005,998,0002,510,848
8Dec 22, 2025 08:115,097191,931,421163,200,0005,006,0002,527,232
9Dec 22, 2025 08:115,232194,492,896169,648,0002,993,0002,428,928