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 14, 2026 12:06Adam FolwarcznyAdam FolwarcznyScore: 14,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 12:0614,156488,216,570458,139,0009,002,0002,297,856
2Jan 14, 2026 12:0614,166496,490,675456,487,00010,987,0002,330,624
3Jan 14, 2026 12:0614,196498,013,314456,479,00011,986,0002,502,656
4Jan 14, 2026 12:0614,208493,768,973461,873,0006,998,0002,420,736
5Jan 14, 2026 12:0614,245492,602,339464,083,0006,001,0002,306,048
6Jan 14, 2026 12:0614,267491,248,663463,817,0006,997,0002,404,352
7Jan 14, 2026 12:0614,289497,088,515460,535,00010,988,0002,392,064
8Jan 14, 2026 12:0614,317500,862,045464,478,0007,991,0002,396,160
9Jan 14, 2026 12:0614,693503,250,501476,876,0007,997,0002,404,352