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 12, 2026 23:01Adam FolwarcznyAdam FolwarcznyScore: 29,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 23:0129,121990,581,238948,012,00012,986,0002,273,280
2Jan 12, 2026 23:0129,160990,845,921954,292,0007,994,0002,371,584
3Jan 12, 2026 23:0129,189996,005,452951,248,00011,990,0002,506,752
4Jan 12, 2026 23:0129,287989,835,595953,485,00012,992,0002,285,568
5Jan 12, 2026 23:0129,291995,864,120953,625,00012,994,0002,437,120
6Jan 12, 2026 23:0129,297997,730,615953,818,00012,997,0002,310,144
7Jan 12, 2026 23:0129,3611,001,378,532958,900,0009,998,0002,269,184
8Jan 12, 2026 23:0130,0111,020,002,267977,399,00012,978,0002,301,952
9Jan 12, 2026 23:0130,0631,019,497,030977,101,00014,970,0002,318,336