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 listJul 25, 2026 17:47boop34boop34Score: 9,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:489,669329,008,732316,767,0002,339,0002,113,536
2Jul 25, 2026 17:489,675329,585,168317,068,0002,217,0002,113,536
3Jul 25, 2026 17:489,679329,334,992317,178,0002,250,0002,113,536
4Jul 25, 2026 17:489,708330,729,885318,134,0002,235,0002,113,536
5Jul 25, 2026 17:489,749331,671,294319,368,0002,349,0002,113,536
6Jul 25, 2026 17:489,772332,414,483320,080,0002,416,0002,113,536
7Jul 25, 2026 17:489,805333,894,600321,331,0002,235,0002,113,536
8Jul 25, 2026 17:489,812333,640,032321,530,0002,288,0002,113,536
9Jul 25, 2026 17:489,841334,643,158322,418,0002,356,0002,113,536