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 24, 2026 09:08Victor MerckléVictor MerckléScore: 1,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:091,74452,341,937124,885,0002,041,0002,170,880stderr
2Aug 24, 2026 09:091,75252,589,011125,861,0002,032,0002,170,880stderr
3Aug 24, 2026 09:091,75652,697,689125,147,0002,058,0002,170,880stderr
4Aug 24, 2026 09:091,76152,830,765126,031,0001,008,0002,170,880stderr
5Aug 24, 2026 09:091,76252,872,807125,026,0001,033,0002,170,880stderr
6Aug 24, 2026 09:091,77053,111,664126,122,0001,034,0002,170,880stderr
7Aug 24, 2026 09:091,77253,167,981125,395,0001,028,0002,170,880stderr
8Aug 24, 2026 09:091,77853,350,628125,393,0001,009,0002,170,880stderr
9Aug 24, 2026 09:091,78753,624,956126,163,0001,018,0002,170,880stderr