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 listMay 25, 2025 00:58Emanuele BolognesiEmanuele BolognesiScore: 50,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 00:5849,8811,496,440,0481,440,220,00031,982,0002,551,808
2May 25, 2025 00:5849,8931,496,798,5431,436,449,00037,985,0002,662,400
3May 25, 2025 00:5850,0211,500,623,3351,429,440,00045,982,0002,756,608
4May 25, 2025 00:5850,0381,501,140,5191,433,327,00039,981,0002,772,992
5May 25, 2025 00:5850,1091,503,257,0381,444,228,00030,983,0002,670,592
6May 25, 2025 00:5850,5571,516,698,5261,457,571,00035,989,0002,629,632
7May 25, 2025 00:5850,8871,526,622,1291,461,087,00038,975,0002,543,616
8May 25, 2025 00:5851,0811,532,444,2811,463,709,00041,963,0002,543,616
9May 25, 2025 00:5851,1001,532,988,2911,463,795,00036,969,0002,514,944