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 4, 2026 22:03zielajzielajScore: 3,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 22:013,097123,492,546100,207,0002,004,0002,535,424
2Jan 4, 2026 22:013,106125,006,844100,481,0002,009,0002,420,736
3Jan 4, 2026 22:023,115129,936,127101,790,000997,0002,535,424
4Jan 4, 2026 22:033,119129,449,651101,944,000999,0002,535,424
5Jan 4, 2026 22:023,122131,228,897102,024,0001,000,0002,273,280
6Jan 4, 2026 22:023,140127,314,312101,602,0002,011,0002,416,640
7Jan 4, 2026 22:013,162124,977,676102,354,0002,006,0002,416,640
8Jan 4, 2026 22:033,189124,982,350104,220,0001,002,0002,420,736
9Jan 4, 2026 22:033,209126,743,186104,900,000999,0002,535,424