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 11:50Adam FolwarcznyAdam FolwarcznyScore: 15,195Success
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 11:5015,066526,815,466488,167,0009,003,0002,428,928
2Jan 14, 2026 11:5015,090524,468,242488,971,0008,999,0002,437,120
3Jan 14, 2026 11:5015,166529,816,846494,477,0005,993,0002,355,200
4Jan 14, 2026 11:5015,168526,627,246490,545,0009,990,0002,408,448
5Jan 14, 2026 11:5015,195527,465,004492,441,0008,989,0002,416,640
6Jan 14, 2026 11:5015,221529,585,168493,286,0009,005,0002,428,928
7Jan 14, 2026 11:5015,229523,057,758493,551,0008,991,0002,514,944
8Jan 14, 2026 11:5015,428537,622,805500,107,0009,001,0002,441,216
9Jan 14, 2026 11:5015,443535,720,462501,626,0007,994,0002,408,448