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 22:19Victor MerckléVictor MerckléScore: 4,589Success
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 22:274,546136,380,164375,697,0003,160,0002,617,344stderr
2Aug 15, 2026 22:274,550136,526,830377,209,0003,103,0002,662,400stderr
3Aug 15, 2026 22:274,564136,937,948377,266,0004,083,0002,662,400stderr
4Aug 15, 2026 22:274,588137,645,043379,960,0003,109,0002,650,112stderr
5Aug 15, 2026 22:274,589137,699,853377,744,0003,088,0002,654,208stderr
6Aug 15, 2026 22:274,593137,803,737377,144,0003,104,0002,695,168stderr
7Aug 15, 2026 22:274,604138,147,131377,337,0003,104,0002,695,168stderr
8Aug 15, 2026 22:274,649139,474,695378,655,0003,116,0002,654,208stderr
9Aug 15, 2026 22:274,663139,918,506382,036,0003,141,0002,695,168stderr