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 17, 2026 02:18M-RochatM-RochatScore: 21,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:1921,402642,089,969628,520,0003,008,0002,113,536
2May 17, 2026 02:1921,409642,279,695630,051,0003,352,0002,113,536
3May 17, 2026 02:1921,477644,332,803632,049,0003,012,0002,113,536
4May 17, 2026 02:1921,508645,251,456631,700,0004,076,0002,113,536
5May 17, 2026 02:1921,524645,720,552633,582,0003,244,0002,113,536
6May 17, 2026 02:1921,560646,827,317632,634,0003,009,0002,113,536
7May 17, 2026 02:1921,589647,698,723632,581,0003,010,0002,113,536
8May 17, 2026 02:1921,725651,770,223636,883,0003,302,0002,113,536
9May 17, 2026 02:1921,739652,199,675637,469,0003,007,0002,113,536