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 18, 2026 16:52Victor MerckléVictor MerckléScore: 3,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:533,08292,471,817244,245,0001,005,0002,654,208
2Jun 18, 2026 16:533,08492,532,797242,131,0003,079,0002,654,208
3Jun 18, 2026 16:533,09692,899,599241,636,0003,181,0002,654,208
4Jun 18, 2026 16:533,10093,014,576241,760,0003,036,0002,654,208
5Jun 18, 2026 16:533,10293,071,775241,111,0003,171,0002,654,208
6Jun 18, 2026 16:533,11093,312,596242,897,0003,101,0002,654,208
7Jun 18, 2026 16:533,11993,591,738244,793,0003,073,0002,654,208
8Jun 18, 2026 16:533,13494,043,750244,414,0003,134,0002,654,208
9Jun 18, 2026 16:533,16795,031,424243,095,0003,077,0002,654,208