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 18, 2026 04:53Josu San MartinJosu San MartinScore: 4,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:564,629138,886,878197,164,0003,181,0002,170,880
2Aug 18, 2026 04:564,652139,562,790195,904,0004,338,0002,170,880
3Aug 18, 2026 04:564,667140,016,945197,000,0004,293,0002,170,880
4Aug 18, 2026 04:564,670140,123,790195,818,0004,314,0002,170,880
5Aug 18, 2026 04:564,671140,150,391197,150,0004,125,0002,170,880
6Aug 18, 2026 04:564,809144,282,327199,820,0004,099,0002,179,072
7Aug 18, 2026 04:564,922147,684,265202,558,0004,240,0002,170,880
8Aug 18, 2026 04:565,631168,948,484233,838,0004,427,0002,170,880
9Aug 18, 2026 04:566,425192,777,747259,921,0005,392,0002,170,880