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 19, 2025 08:43Rajarshi BasuRajarshi BasuScore: 8,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 08:437,808285,919,536250,682,0006,991,0002,453,504
2Dec 19, 2025 08:437,871284,804,980252,750,0006,993,0002,510,848
3Dec 19, 2025 08:437,941288,840,552253,047,0009,001,0002,535,424
4Dec 19, 2025 08:437,976291,766,646256,208,0007,005,0002,387,968
5Dec 19, 2025 08:438,029291,716,921257,949,0006,998,0002,396,160
6Dec 19, 2025 08:438,056290,876,957257,868,0007,995,0002,424,832
7Dec 19, 2025 08:438,070292,171,039259,303,0007,008,0002,445,312
8Dec 19, 2025 08:438,078293,367,862257,594,0008,985,0002,453,504
9Dec 19, 2025 08:438,566313,856,005277,690,0004,994,0002,334,720