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 15, 2026 23:17Victor MerckléVictor MerckléScore: 4,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:274,445133,357,703367,648,0003,162,0002,695,168stderr
2Aug 15, 2026 23:274,449133,494,433366,405,0003,053,0002,654,208stderr
3Aug 15, 2026 23:274,459133,789,080366,999,0003,122,0002,613,248stderr
4Aug 15, 2026 23:274,462133,866,473368,913,0003,159,0002,654,208stderr
5Aug 15, 2026 23:274,463133,901,504367,371,0003,160,0002,695,168stderr
6Aug 15, 2026 23:274,464133,924,756368,938,0003,115,0002,617,344stderr
7Aug 15, 2026 23:274,474134,227,334367,394,0003,102,0002,613,248stderr
8Aug 15, 2026 23:274,487134,616,222370,763,0003,160,0002,695,168stderr
9Aug 15, 2026 23:274,494134,822,243370,720,0003,156,0002,654,208stderr