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 03:28M-RochatM-RochatScore: 20,904Success
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 03:2920,767623,028,827610,838,0003,277,0002,113,536
2May 17, 2026 03:2920,864625,934,575613,663,0003,226,0002,113,536
3May 17, 2026 03:2920,878626,355,508612,980,0003,175,0002,113,536
4May 17, 2026 03:2920,886626,603,822614,088,0003,358,0002,113,536
5May 17, 2026 03:2920,904627,140,411612,037,0003,262,0002,113,536
6May 17, 2026 03:2920,913627,392,007615,360,0003,239,0002,113,536
7May 17, 2026 03:2921,298638,943,295624,343,0003,011,0002,113,536
8May 17, 2026 03:2921,299638,970,902623,786,0003,374,0002,113,536
9May 17, 2026 03:2921,364640,932,665626,905,0003,315,0002,113,536