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 23, 2026 22:05Andrew EpsteinAndrew EpsteinScore: 12,073Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:56Tomislav Tunkovic25.87CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 22:0812,020360,622,515325,342,00024,295,0002,138,112
2Aug 23, 2026 22:0812,044361,339,162326,329,00024,331,0002,138,112
3Aug 23, 2026 22:0812,060361,829,777326,730,00024,025,0002,138,112
4Aug 23, 2026 22:0812,065361,975,036326,526,00024,428,0002,138,112
5Aug 23, 2026 22:0812,073362,190,939327,077,00024,358,0002,125,824
6Aug 23, 2026 22:0812,086362,596,708326,951,00024,155,0002,125,824
7Aug 23, 2026 22:0812,119363,584,901328,383,00024,301,0002,138,112
8Aug 23, 2026 22:0812,161364,834,731330,624,00023,452,0002,138,112
9Aug 23, 2026 22:0812,179365,383,818330,458,00023,392,0002,138,112