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 16, 2026 03:12Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 03:13092,637,970243,090,0001,039,0002,654,208expected "1025579 ", got "1025578 "
2Jun 16, 2026 03:133,08792,638,531241,477,0003,046,0002,654,208
3Jun 16, 2026 03:133,09392,792,172242,381,0003,133,0002,654,208
4Jun 16, 2026 03:133,12493,742,192244,245,0003,088,0002,650,112
5Jun 16, 2026 03:133,12493,730,555247,525,0001,088,0002,654,208
6Jun 16, 2026 03:133,14094,212,206244,394,0001,004,0002,654,208
7Jun 16, 2026 03:133,14194,246,294247,816,0001,018,0002,650,112
8Jun 16, 2026 03:133,16394,910,142243,584,0002,061,0002,654,208
9Jun 16, 2026 03:133,16995,078,580247,790,00002,650,112