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 12:10Victor MerckléVictor MerckléScore: 2,135Success
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 12:132,11463,444,720157,942,0001,049,0002,170,880stderr
2Aug 31, 2026 12:132,11663,494,262158,448,0001,011,0002,170,880stderr
3Aug 31, 2026 12:132,12163,638,271157,795,0001,055,0002,170,880stderr
4Aug 31, 2026 12:132,12463,742,258157,524,0001,069,0002,170,880stderr
5Aug 31, 2026 12:132,13564,066,167157,897,0001,044,0002,170,880stderr
6Aug 31, 2026 12:132,13864,166,425159,487,0001,125,0002,170,880stderr
7Aug 31, 2026 12:132,15364,599,284158,696,0001,070,0002,170,880stderr
8Aug 31, 2026 12:132,15764,726,492159,514,0001,045,0002,170,880stderr
9Aug 31, 2026 12:132,17265,185,809159,863,0001,196,0002,170,880stderr