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 listMay 5, 2026 07:18olliecrowolliecrowScore: 17,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:1917,216516,493,392485,751,00012,379,0002,584,576
2May 5, 2026 07:1917,232516,971,573486,891,00012,518,0002,330,624
3May 5, 2026 07:1917,346520,380,762489,556,00012,625,0002,322,432
4May 5, 2026 07:1917,374521,241,277491,629,00012,808,0002,330,624
5May 5, 2026 07:1917,377521,318,252490,724,00012,468,0002,322,432
6May 5, 2026 07:1917,383521,511,620493,145,00012,470,0002,584,576
7May 5, 2026 07:1917,408522,249,338490,539,00012,512,0002,322,432
8May 5, 2026 07:1917,445523,361,030491,897,00012,399,0002,326,528
9May 5, 2026 07:1917,495524,879,487493,230,00012,812,0002,580,480