Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listAug 15, 2026 22:10Victor MerckléVictor MerckléScore: 4,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:124,514135,448,909372,626,0003,136,0002,654,208stderr
2Aug 15, 2026 22:124,534136,031,720372,605,0003,114,0002,654,208stderr
3Aug 15, 2026 22:124,572137,174,841378,073,0003,153,0002,613,248stderr
4Aug 15, 2026 22:124,580137,423,929379,369,0003,141,0002,613,248stderr
5Aug 15, 2026 22:124,583137,515,379379,453,0003,125,0002,654,208stderr
6Aug 15, 2026 22:124,592137,782,519380,334,0003,178,0002,695,168stderr
7Aug 15, 2026 22:124,596137,890,932380,425,0003,179,0002,613,248stderr
8Aug 15, 2026 22:124,604138,140,474378,492,0003,132,0002,695,168stderr
9Aug 15, 2026 22:124,604138,123,777380,393,0003,160,0002,695,168stderr