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 15:06Victor MerckléVictor MerckléScore: 3,117Success
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 15:073,06992,078,084239,654,0003,084,0002,654,208
2Jun 11, 2026 15:073,07292,173,765240,308,0003,052,0002,654,208
3Jun 11, 2026 15:073,07792,334,984241,427,0002,018,0002,650,112
4Jun 11, 2026 15:073,08792,635,954242,623,0003,058,0002,654,208
5Jun 11, 2026 15:073,11793,533,636243,775,0003,166,0002,654,208
6Jun 11, 2026 15:073,11993,599,330245,965,0001,031,0002,654,208
7Jun 11, 2026 15:073,12393,704,986245,613,0003,060,0002,412,544
8Jun 11, 2026 15:073,13894,152,292245,422,0003,095,0002,654,208
9Jun 11, 2026 15:073,14294,285,559244,085,00002,650,112