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 listJun 7, 2026 04:00Victor MerckléVictor MerckléScore: 3,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:013,481104,443,671275,285,0002,204,0002,142,208
2Jun 7, 2026 04:013,486104,580,197275,725,0001,154,0002,146,304
3Jun 7, 2026 04:013,521105,652,775278,110,0002,214,0002,142,208
4Jun 7, 2026 04:013,641109,240,101293,669,0002,209,0002,142,208
5Jun 7, 2026 04:013,960118,814,781319,562,0001,009,0002,142,208
6Jun 7, 2026 04:013,967119,018,066306,114,0001,013,0002,142,208
7Jun 7, 2026 04:014,030120,907,531305,904,0002,316,0002,146,304
8Jun 7, 2026 04:014,037121,114,778322,525,0002,193,0002,142,208
9Jun 7, 2026 04:014,045121,375,417305,937,0001,169,0002,146,304