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 03:13Victor MerckléVictor MerckléScore: 5,016Success
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 03:144,768143,046,754396,471,0003,007,0002,273,280stderr
2Aug 16, 2026 03:144,805144,161,962399,635,0003,074,0002,297,856stderr
3Aug 16, 2026 03:144,817144,526,335399,766,0003,117,0002,523,136stderr
4Aug 16, 2026 03:144,887146,622,453404,404,0003,102,0002,543,616stderr
5Aug 16, 2026 03:145,016150,487,133417,735,0003,007,0002,248,704stderr
6Aug 16, 2026 03:145,134154,022,297426,887,0003,109,0002,527,232stderr
7Aug 16, 2026 03:145,145154,371,142426,977,0004,149,0002,256,896stderr
8Aug 16, 2026 03:145,182155,464,030429,853,0003,053,0002,519,040stderr
9Aug 16, 2026 03:145,205156,157,607430,620,0004,126,0002,314,240stderr