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 listApr 28, 2026 17:37Victor MerckléVictor MerckléScore: 6,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:385,859175,794,270438,094,00013,971,0002,887,680
2Apr 28, 2026 17:385,907177,222,876452,591,0006,993,0002,842,624
3Apr 28, 2026 17:385,927177,823,714457,171,00011,952,0002,916,352
4Apr 28, 2026 17:385,982179,465,614441,792,00012,993,0002,863,104
5Apr 28, 2026 17:386,018180,555,447452,835,0009,996,0002,846,720
6Apr 28, 2026 17:386,189185,672,156451,925,00010,998,0002,875,392
7Apr 28, 2026 17:386,214186,448,579458,670,00010,992,0002,850,816
8Apr 28, 2026 17:386,308189,243,083437,518,0007,991,0002,670,592
9Apr 28, 2026 17:387,692230,779,246478,612,0004,005,0002,502,656