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 listJun 7, 2026 03:21Victor MerckléVictor MerckléScore: 6,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 03:226,580224,889,400179,970,00037,175,0002,113,536
2Jun 7, 2026 03:226,585225,085,779179,460,00037,859,0002,113,536
3Jun 7, 2026 03:226,585224,922,574179,917,00037,395,0002,113,536
4Jun 7, 2026 03:226,591225,155,035180,043,00037,464,0002,113,536
5Jun 7, 2026 03:226,597225,466,503179,995,00037,722,0002,113,536
6Jun 7, 2026 03:226,600225,532,267180,403,00037,405,0002,113,536
7Jun 7, 2026 03:226,614226,020,933180,872,00037,421,0002,113,536
8Jun 7, 2026 03:226,624226,308,890181,184,00037,440,0002,113,536
9Jun 7, 2026 03:226,629228,387,623180,291,00038,475,0002,113,536