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 19:25M-RochatM-RochatScore: 20,309Success
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 19:2619,744592,326,100578,834,0004,026,0002,117,632
2May 22, 2026 19:2619,881596,443,429583,934,0004,066,0002,117,632
3May 22, 2026 19:2620,226606,788,247592,765,0004,109,0002,117,632
4May 22, 2026 19:2620,242607,287,589592,989,0004,166,0002,117,632
5May 22, 2026 19:2620,309609,282,972596,926,0004,035,0002,117,632
6May 22, 2026 19:2620,323609,712,505597,752,0004,062,0002,117,632
7May 22, 2026 19:2620,472614,183,056600,551,0004,027,0002,117,632
8May 22, 2026 19:2621,690650,708,625637,231,0004,032,0002,117,632
9May 22, 2026 19:2621,952658,570,490644,642,0004,216,0002,117,632