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 13, 2026 23:30Adam FolwarcznyAdam FolwarcznyScore: 15,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 23:3015,217528,255,990492,143,00010,002,0002,330,624
2Jan 13, 2026 23:3015,256530,680,747493,465,0009,989,0002,363,392
3Jan 13, 2026 23:3015,270534,651,243492,914,00010,998,0002,535,424
4Jan 13, 2026 23:3015,287528,463,245497,488,0006,992,0002,506,752
5Jan 13, 2026 23:3015,329530,096,892496,870,0008,997,0002,457,600
6Jan 13, 2026 23:3015,346535,719,105498,436,0007,990,0002,412,544
7Jan 13, 2026 23:3015,347531,833,538497,471,0008,990,0002,465,792
8Jan 13, 2026 23:3015,386529,708,442499,737,0007,995,0002,265,088
9Jan 13, 2026 23:3016,022555,187,647518,761,0009,976,0002,408,448