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 21, 2026 17:46M-RochatM-RochatScore: 21,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:4721,042631,280,228614,700,0003,203,0002,113,536
2May 21, 2026 17:4721,263637,916,303624,314,0003,227,0002,113,536
3May 21, 2026 17:4721,337640,122,442624,995,0003,194,0002,113,536
4May 21, 2026 17:4721,345640,351,338623,396,0003,153,0002,113,536
5May 21, 2026 17:4721,364640,937,509627,370,0003,164,0002,113,536
6May 21, 2026 17:4723,018690,559,353677,820,0003,121,0002,113,536
7May 21, 2026 17:4723,041691,259,239676,840,0003,153,0002,113,536
8May 21, 2026 17:4723,041691,253,648676,669,0003,144,0002,113,536
9May 21, 2026 17:4723,156694,685,321678,694,0003,125,0002,113,536