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 listMay 3, 2026 20:08TudyMTudyMScore: 24,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:0924,653827,815,412795,039,00018,520,0002,531,328
2May 3, 2026 20:0924,759836,300,573798,963,00018,088,0002,543,616
3May 3, 2026 20:0924,769833,483,925798,977,00018,416,0002,531,328
4May 3, 2026 20:0924,910835,751,374803,034,00019,017,0002,527,232
5May 3, 2026 20:0924,939842,970,443804,587,00018,422,0002,539,520
6May 3, 2026 20:0925,179846,216,337811,849,00019,062,0002,539,520
7May 3, 2026 20:0925,218848,655,103813,601,00018,598,0002,539,520
8May 3, 2026 20:0925,236851,627,081814,234,00018,567,0002,539,520
9May 3, 2026 20:0926,114877,017,211843,427,00018,348,0002,543,616