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 18:04M-RochatM-RochatScore: 20,063Success
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 18:0519,636589,086,880575,338,0004,256,0002,113,536
2May 22, 2026 18:0519,916597,500,330580,322,0004,267,0002,113,536
3May 22, 2026 18:0519,981599,437,392585,555,0004,233,0002,113,536
4May 22, 2026 18:0520,007600,232,887586,498,0004,260,0002,113,536
5May 22, 2026 18:0520,063601,900,568587,260,0004,254,0002,113,536
6May 22, 2026 18:0520,146604,396,905590,758,0004,016,0002,113,536
7May 22, 2026 18:0520,157604,731,245590,989,0004,213,0002,113,536
8May 22, 2026 18:0520,285608,554,199593,849,0004,256,0002,113,536
9May 22, 2026 18:0521,621648,643,825632,923,0004,299,0002,113,536