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 17, 2026 15:29Victor MerckléVictor MerckléScore: 3,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 15:343,11693,491,007244,822,0007,339,0002,527,232stderr
2Aug 17, 2026 15:343,11793,516,051245,623,0006,613,0002,596,864stderr
3Aug 17, 2026 15:343,12193,657,021244,719,0007,437,0002,527,232stderr
4Aug 17, 2026 15:343,12793,837,857244,653,0007,685,0002,600,960stderr
5Aug 17, 2026 15:343,14194,249,576244,096,0008,817,0002,527,232stderr
6Aug 17, 2026 15:343,14194,258,190244,664,0007,579,0002,600,960stderr
7Aug 17, 2026 15:343,14694,387,311244,621,0008,773,0002,576,384stderr
8Aug 17, 2026 15:343,16394,892,321244,771,0008,566,0002,576,384stderr
9Aug 17, 2026 15:343,17195,134,273245,538,0007,707,0002,576,384stderr