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 listJan 1, 2026 21:09zielajzielajScore: 3,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:043,399132,222,590110,178,0002,003,0002,416,640
2Jan 2, 2026 08:433,442141,793,736112,581,0001,005,0002,273,280
3Jan 2, 2026 08:433,453135,337,932112,958,000999,0002,273,280
4Jan 1, 2026 21:043,480138,410,850112,847,0001,997,0002,416,640
5Jan 1, 2026 21:093,510143,509,758113,841,0001,997,0002,408,448
6Jan 1, 2026 21:093,607139,909,542117,027,0002,000,0002,273,280
7Jan 1, 2026 21:093,610140,134,512117,123,0002,002,0002,441,216
8Jan 2, 2026 08:433,636145,670,646117,998,0001,999,0002,416,640
9Jan 1, 2026 21:043,683149,273,501120,521,0001,004,0002,535,424