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 31, 2026 12:59Victor MerckléVictor MerckléScore: 1,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 13:001,73952,192,283125,327,0001,270,0002,170,880stderr
2Aug 31, 2026 13:001,74452,329,056124,949,0002,038,0002,170,880stderr
3Aug 31, 2026 13:001,76853,058,122124,807,0001,029,0002,170,880stderr
4Aug 31, 2026 13:001,77053,115,587123,441,0001,039,0002,170,880stderr
5Aug 31, 2026 13:001,80354,101,680128,323,0002,023,0002,170,880stderr
6Aug 31, 2026 13:001,80554,162,565128,601,0001,032,0002,170,880stderr
7Aug 31, 2026 13:001,82654,787,560130,845,0001,025,0002,170,880stderr
8Aug 31, 2026 13:001,83355,003,736129,315,0001,022,0002,170,880stderr
9Aug 31, 2026 13:001,88356,505,368135,765,0002,027,0002,170,880stderr