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 26, 2026 19:45TudyMTudyMScore: 21,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 19:4619,613588,392,3621,577,546,00030,971,0002,822,144
2Apr 26, 2026 19:4620,061601,847,4701,624,222,00030,985,0002,945,024
3Apr 26, 2026 19:4620,063601,903,2781,615,748,00034,972,0002,990,080
4Apr 26, 2026 19:4621,049631,497,1581,689,525,00038,919,0002,842,624
5Apr 26, 2026 19:4621,493644,812,7521,729,708,00037,905,0002,580,480
6Apr 26, 2026 19:4621,579647,395,7411,757,387,00037,943,0002,953,216
7Apr 26, 2026 19:4621,863655,908,1581,780,845,00030,945,0002,940,928
8Apr 26, 2026 19:4621,896656,890,0901,784,599,00035,931,0002,584,576
9Apr 26, 2026 19:4622,109663,287,5671,791,148,00030,950,0002,945,024