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 21:44Victor MerckléVictor MerckléScore: 9,377Success
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 21:459,265277,962,770454,546,00057,068,0002,662,400
2Apr 28, 2026 21:459,270278,119,356458,573,00059,813,0002,596,864
3Apr 28, 2026 21:459,341280,233,075455,324,00053,802,0002,830,336
4Apr 28, 2026 21:459,376281,303,430458,405,00063,778,0002,564,096
5Apr 28, 2026 21:459,377281,314,543458,272,00064,615,0002,834,432
6Apr 28, 2026 21:459,523285,691,151456,855,00063,700,0002,822,144
7Apr 28, 2026 21:459,531285,943,733459,003,00059,740,0002,625,536
8Apr 28, 2026 21:459,658289,750,225454,479,00063,786,0002,797,568
9Apr 28, 2026 21:459,885296,565,411453,008,00064,573,0002,539,520