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 09:08Andrew EpsteinAndrew EpsteinScore: 1,487Success
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 09:111,46944,073,192101,035,0001,127,0002,170,880stderr
2Oct 31, 2026 09:111,46944,092,024100,215,0001,209,0002,162,688stderr
3Oct 31, 2026 09:111,47144,155,860100,612,0001,116,0002,170,880stderr
4Oct 31, 2026 09:111,48344,493,561102,108,0001,107,0002,162,688stderr
5Oct 31, 2026 09:111,48744,613,529102,808,0001,125,0002,162,688stderr
6Oct 31, 2026 09:111,50145,033,434103,522,0001,076,0002,162,688stderr
7Oct 31, 2026 09:111,50645,202,832103,793,0001,125,0002,170,880stderr
8Oct 31, 2026 09:111,53145,939,477101,284,0001,296,0002,170,880stderr
9Oct 31, 2026 09:111,53946,179,014103,015,0001,105,0002,170,880stderr