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 16, 2026 09:34Victor MerckléVictor MerckléScore: 3,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 09:393,09592,855,612246,327,0001,028,0002,170,880stderr
2Aug 16, 2026 09:393,11393,419,926248,446,0002,034,0002,170,880stderr
3Aug 16, 2026 09:393,13794,125,219249,816,0001,054,0002,170,880stderr
4Aug 16, 2026 09:393,13894,140,711249,502,0001,022,0002,170,880stderr
5Aug 16, 2026 09:393,14694,385,787249,140,0002,010,0002,170,880stderr
6Aug 16, 2026 09:393,14994,480,855249,397,0002,002,0002,170,880stderr
7Aug 16, 2026 09:393,17995,377,433253,197,0001,004,0002,170,880stderr
8Aug 16, 2026 09:393,18095,422,770250,151,0001,045,0002,170,880stderr
9Aug 16, 2026 09:393,19895,945,390249,918,0001,033,0002,170,880stderr