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 03:32Josu San MartinJosu San MartinScore: 4,735Success
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 03:364,727141,814,588200,444,0003,375,0002,187,264
2Aug 18, 2026 03:364,729141,892,390200,030,0003,413,0002,187,264
3Aug 18, 2026 03:364,731141,956,333199,779,0003,337,0002,187,264
4Aug 18, 2026 03:364,732141,980,876200,078,0003,193,0002,187,264
5Aug 18, 2026 03:364,735142,074,322200,326,0003,170,0002,273,280
6Aug 18, 2026 03:364,744142,334,141200,440,0003,211,0002,187,264
7Aug 18, 2026 03:364,754142,622,226201,281,0003,145,0002,187,264
8Aug 18, 2026 03:364,769143,094,163202,198,0003,226,0002,187,264
9Aug 18, 2026 03:364,838145,140,195204,054,0003,390,0002,187,264