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 15, 2026 23:03Adam FolwarcznyAdam FolwarcznyScore: 10,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 23:0310,328360,895,552331,817,0008,995,0002,506,752
2Jan 15, 2026 23:0310,350369,786,742332,577,0008,988,0002,412,544
3Jan 15, 2026 23:0310,352370,367,504330,627,00010,987,0002,473,984
4Jan 15, 2026 23:0310,390366,053,774334,862,0007,996,0002,285,568
5Jan 15, 2026 23:0310,395365,903,612334,024,0009,000,0002,322,432
6Jan 15, 2026 23:0310,412375,778,143333,598,0009,987,0002,465,792
7Jan 15, 2026 23:0310,417365,208,162334,767,0008,993,0002,408,448
8Jan 15, 2026 23:0310,465372,050,159335,328,00010,009,0002,457,600
9Jan 15, 2026 23:0310,595371,582,610338,656,00010,988,0002,383,872