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:25M-RochatM-RochatScore: 32,036Success
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:2631,981959,446,466926,320,00022,355,0002,117,632
2May 22, 2026 18:2631,991959,745,807927,223,00022,303,0002,117,632
3May 22, 2026 18:2631,991959,738,454927,112,00022,435,0002,117,632
4May 22, 2026 18:2632,033960,998,129926,621,00022,215,0002,117,632
5May 22, 2026 18:2632,036961,090,163927,246,00022,087,0002,117,632
6May 22, 2026 18:2632,064961,934,139928,547,00022,305,0002,117,632
7May 22, 2026 18:2632,129963,875,691928,233,00022,359,0002,117,632
8May 22, 2026 18:2632,398971,941,043939,218,00022,120,0002,117,632
9May 22, 2026 18:2632,437973,124,603938,748,00022,125,0002,117,632