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 22, 2026 11:30M-RochatM-RochatScore: 20,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 11:3120,169605,085,058589,399,0004,047,0002,113,536
2May 22, 2026 11:3120,199605,972,803592,157,0004,160,0002,113,536
3May 22, 2026 11:3120,297608,931,981593,232,0004,261,0002,113,536
4May 22, 2026 11:3120,372611,180,106595,057,0004,226,0002,113,536
5May 22, 2026 11:3120,437613,128,051597,599,0004,203,0002,113,536
6May 22, 2026 11:3120,444613,348,212598,223,0004,219,0002,113,536
7May 22, 2026 11:3120,553616,614,492602,994,0004,058,0002,113,536
8May 22, 2026 11:3121,216636,496,013621,347,0004,093,0002,113,536
9May 22, 2026 11:3121,315639,471,682623,898,0004,139,0002,113,536