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 2, 2025 05:13KeefeKeefeScore: 36,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2025 05:1336,1681,085,044,4692,987,503,00030,984,0002,609,152
2May 2, 2025 05:1336,3081,089,238,4402,984,860,00032,987,0002,498,560
3May 2, 2025 05:1336,3631,090,884,5772,976,882,00032,976,0002,392,064
4May 2, 2025 05:1336,3861,091,579,3382,974,380,00036,992,0002,777,088
5May 2, 2025 05:1336,4451,093,340,6322,964,840,00033,998,0002,809,856
6May 2, 2025 05:1336,5551,096,645,0262,970,211,00033,979,0002,355,200
7May 2, 2025 05:1336,5901,097,700,0492,994,286,00037,965,0002,531,328
8May 2, 2025 05:1337,6241,128,734,8112,993,753,00042,953,0002,797,568
9May 2, 2025 05:1337,6501,129,503,3592,998,069,00032,978,0002,605,056