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 22:52Adam FolwarcznyAdam FolwarcznyScore: 16,415Success
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 22:5816,353570,377,127532,647,0006,995,0002,273,280
2Jan 13, 2026 22:5216,366565,932,671534,091,0006,001,0002,523,136
3Jan 13, 2026 22:5816,410563,927,713533,538,0007,993,0002,355,200
4Jan 13, 2026 22:5216,415566,881,662533,700,0007,995,0002,420,736
5Jan 13, 2026 22:5216,676582,908,796540,335,0009,987,0002,441,216
6Jan 13, 2026 22:5816,744576,806,069539,578,00012,989,0002,347,008