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 11, 2026 00:39Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 00:420253,827,445713,322,0006,624,0002,142,208expected "1022819 ", got "1022818 "
2Jun 11, 2026 00:428,345250,350,892704,434,0006,839,0002,404,352
3Jun 11, 2026 00:428,548256,457,541722,076,0006,917,0002,404,352
4Jun 11, 2026 00:428,582257,460,239724,724,0006,780,0002,666,496
5Jun 11, 2026 00:428,587257,639,835724,402,0006,809,0002,404,352
6Jun 11, 2026 00:428,588257,659,105727,856,0006,968,0002,404,352
7Jun 11, 2026 00:428,613258,391,576725,023,0006,904,0002,400,256
8Jun 11, 2026 00:428,637259,125,958728,177,0006,764,0002,404,352
9Jun 11, 2026 00:428,678260,342,541731,861,0005,569,0002,404,352