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 14, 2025 01:32Joad NacerJoad NacerScore: 4,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2025 01:324,429176,195,661143,184,0002,983,0002,506,752
2Dec 14, 2025 01:324,615177,320,544150,281,0002,003,0002,523,136
3Dec 14, 2025 01:324,619177,300,536151,418,0001,002,0002,523,136
4Dec 14, 2025 01:324,624183,075,377147,601,0004,986,0002,506,752
5Dec 14, 2025 01:324,645179,635,761150,274,0003,005,0002,519,040
6Dec 14, 2025 01:324,645179,896,102148,273,0005,009,0002,519,040
7Dec 14, 2025 01:324,673173,891,275150,194,0004,005,0002,523,136
8Dec 14, 2025 01:324,693178,972,946151,863,0002,997,0002,531,328
9Dec 14, 2025 01:324,695182,718,540151,933,0002,998,0002,523,136