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 listMar 16, 2026 11:36Dominique GarmierDominique GarmierScore: 15,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:3615,469464,082,8921,081,192,000179,533,0002,523,136
2Mar 16, 2026 11:3615,475464,243,6191,086,870,000177,141,0002,600,960
3Mar 16, 2026 11:3615,635469,062,5761,106,238,000155,173,0002,658,304
4Mar 16, 2026 11:3615,678470,346,6421,108,777,000180,313,0002,740,224
5Mar 16, 2026 11:3615,754472,613,7291,127,553,000160,651,0002,756,608
6Mar 16, 2026 11:3615,803474,079,0181,143,232,000145,774,0002,596,864
7Mar 16, 2026 11:3615,928477,839,8061,138,151,000152,217,0002,605,056
8Mar 16, 2026 11:3615,975479,238,0851,132,588,000156,390,0002,760,704
9Mar 16, 2026 11:3615,997479,899,3001,120,042,000169,552,0002,613,248