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 listOct 31, 2026 08:41Andrew EpsteinAndrew EpsteinScore: 1,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 08:431,45143,552,18899,057,0001,214,0002,170,880stderr
2Oct 31, 2026 08:431,45743,723,49699,896,0001,160,0002,170,880stderr
3Oct 31, 2026 08:431,46844,060,434101,009,0001,234,0002,170,880stderr
4Oct 31, 2026 08:431,47144,134,289101,460,0001,132,0002,170,880stderr
5Oct 31, 2026 08:431,48244,465,885102,077,0001,010,0002,170,880stderr
6Oct 31, 2026 08:431,48844,657,416103,106,0001,125,0002,162,688stderr
7Oct 31, 2026 08:431,49144,738,783103,412,0001,012,0002,162,688stderr
8Oct 31, 2026 08:431,49744,936,206103,389,0001,279,0002,170,880stderr
9Oct 31, 2026 08:431,52145,653,327106,021,0001,185,0002,170,880stderr