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 listOct 3, 2024 22:14Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2024 22:1400000Error: expected "1023374 ", got "1023296 "stderr
2Oct 3, 2024 22:144,801186,220,447154,432,0004,011,0002,527,232
3Oct 3, 2024 22:144,835184,113,888154,581,0004,986,0002,416,640
4Oct 3, 2024 22:144,841182,522,759156,769,0002,995,0002,523,136