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 listAug 31, 2026 10: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
1Aug 31, 2026 10:15051,930,857119,673,0002,051,0002,228,224expected "1024239 ", got "1024238 "stderr
2Aug 31, 2026 10:151,70751,217,321117,965,0002,007,0002,228,224stderr
3Aug 31, 2026 10:151,71151,349,088118,488,0002,072,0002,228,224stderr
4Aug 31, 2026 10:151,72751,818,283118,924,0002,005,0002,228,224stderr
5Aug 31, 2026 10:151,73051,918,430120,045,0002,054,0002,228,224stderr
6Aug 31, 2026 10:151,73652,086,416120,046,0002,046,0002,228,224stderr
7Aug 31, 2026 10:151,74552,362,828119,994,0002,008,0002,228,224stderr
8Aug 31, 2026 10:151,76052,822,843119,984,0002,020,0002,228,224stderr
9Aug 31, 2026 10:151,76853,059,507120,865,0002,036,0002,228,224stderr