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 02:04etherealetherealScore: 34,430Success
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 02:0432,312969,369,5612,765,445,00028,962,0002,637,824
2May 25, 2025 02:0432,509975,266,7352,767,857,00033,949,0002,560,000
3May 25, 2025 02:0432,748982,435,5712,786,400,00030,960,0002,449,408
4May 25, 2025 02:0433,8271,014,819,3752,876,063,00037,974,0002,490,368
5May 25, 2025 02:0434,4301,032,886,8982,945,146,00038,962,0002,916,352
6May 25, 2025 02:0434,4971,034,909,1742,947,739,00035,996,0002,576,384
7May 25, 2025 02:0434,5001,035,012,4662,951,149,00031,990,0002,756,608
8May 25, 2025 02:0434,5291,035,879,0142,959,327,00024,985,0002,764,800
9May 25, 2025 02:0434,6091,038,272,0152,953,571,00031,995,0002,650,112