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 listJun 13, 2026 13:05Victor MerckléVictor MerckléScore: 3,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:073,20596,171,162245,005,0003,280,0002,695,168
2Jun 13, 2026 13:073,21196,356,327245,391,0003,349,0002,699,264
3Jun 13, 2026 13:073,21796,529,002245,056,0003,253,0002,699,264
4Jun 13, 2026 13:073,22996,877,872248,970,0003,242,0002,699,264
5Jun 13, 2026 13:073,26197,858,255248,611,0003,194,0002,699,264
6Jun 13, 2026 13:073,27498,230,754246,263,0003,290,0002,699,264
7Jun 13, 2026 13:073,28398,508,133246,594,0003,303,0002,699,264
8Jun 13, 2026 13:073,30199,050,807248,355,0003,307,0002,695,168
9Jun 13, 2026 13:073,31199,335,300249,506,0003,261,0002,699,264